Extendible hashing example: Assuming each leaf (bucket) can hold up to 4 key values (M=4) Directory (“root”) In general:

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

Extendible hashing example: Assuming each leaf (bucket) can hold up to 4 key values (M=4) Directory (“root”) In general:

Post by answerhappygod »

Extendible Hashing Example Assuming Each Leaf Bucket Can Hold Up To 4 Key Values M 4 Directory Root In General 1
Extendible Hashing Example Assuming Each Leaf Bucket Can Hold Up To 4 Key Values M 4 Directory Root In General 1 (177.82 KiB) Viewed 34 times
Extendible hashing example: Assuming each leaf (bucket) can hold up to 4 key values (M=4) Directory (“root”) In general: dL SD (in main memory) D=2 0001 10" Comparison with 2-level B tree “Sinlge pointer” if dL = D Multiple pointers to a bucket if dL <D (2) Indicates 2 leading bits in a leaf are needed to distinguish key values (records) (2) (2) (2) (2) dL=2 000100010100 100000111000 001000011000101000111001 Leaf: Bucket (Disk block) 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”