The following is a slide taken from lecture for extendable hashing. Show the result of inserting 001101 Extendible hashi

Business, Finance, Economics, Accounting, Operations Management, Computer Science, Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Algebra, Precalculus, Statistics and Probabilty, Advanced Math, Physics, Chemistry, Biology, Nursing, Psychology, Certifications, Tests, Prep, and more.
Post Reply
answerhappygod
Site Admin
Posts: 899604
Joined: Mon Aug 02, 2021 8:13 am

The following is a slide taken from lecture for extendable hashing. Show the result of inserting 001101 Extendible hashi

Post by answerhappygod »

The Following Is A Slide Taken From Lecture For Extendable Hashing Show The Result Of Inserting 001101 Extendible Hashi 1
The Following Is A Slide Taken From Lecture For Extendable Hashing Show The Result Of Inserting 001101 Extendible Hashi 1 (87.25 KiB) Viewed 41 times
The following is a slide taken from lecture for extendable hashing. Show the result of inserting 001101 Extendible hashing example: Assuming each leaf (bucket) can hold up to 4 key values (M=4) Directory ("root") In general: dLSD (in main memory) 000110 "Sinlge pointer" if dL =D Comparison with 2-level B tree Multiple pointers to a bucket if dL<D (2) Indicates 2 leading bits in a 00000000000000000000 leaf are needed to distinguish key values (records) Leaf: Bucket (Disk block) dL 001000111000 11000 11001 001010 101100 001011 101110 M-4
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!
Top
Post Reply

Return to “Archived Questions & Answers”