Extendible Hash Table
001
010
011
110
111
101
Directory contains entries labelled by k bits plus a pointer to the bucket with all keys starting with its bits
Each block contains keys+data matching on the first
j ? k bits
000
100
(2)
00001
00011
00100
00110
(2)
01001
01011
01100
(3)
10001
10011
(3)
10101
10110
10111
(2)
11001
11011
11100
11110
directory for k = 3
Previous slide
Next slide
Back to first slide
View graphic version