Download presentation

Presentation is loading. Please wait.

Published byAbel Henney Modified about 1 year ago

1
Extendible Hashing - Class Example

2
0 1 rec 1 rec 2 d 1 =0 record 3 = overflow!! splitting bucket d = 1d = 0 d 1 = local depth d = global depth rec 1 d1 = 1 rec 2 rec 3 rec 4 record 5 = overflow!! splitting bucket NEXT

3
rec 2 rec 3 rec 1 rec 4 rec 5 rec 6 00 10 d = 2 d1 = 2 d1 = 1 11 d1 = 2 01 record 7 = overflow!! splitting bucket NEXT

4
rec 2 rec 3 rec 1 rec 4 rec 5 rec 6 d1 = 3 000 110 d = 3 d1 = 1 111 d1 = 2 001 010 011 100 101 d1 = 3 rec 7 record 8 = overflow!! splitting bucket NEXT

5
record 10 = overflow!! splitting bucket NEXT rec 1 rec 4 000 110 d = 3 111 001 010 011 100 101 d1 = 3 d1 = 2 d1 = 3 d1 = 2 rec 8 rec 2 rec 3 rec 5 rec 6 rec 7 rec 9

6
record 13 = overflow!! splitting bucket NEXT rec 5 rec 6 rec 10 d1 = 3 rec 7 rec 9 d1 = 3 rec 1 rec 4 000 110 d = 3 111 001 010 011 100 101 rec 2 rec 3 d1 = 3 d1 = 2 rec 8 rec 11 rec 12

7
rec 6 d1 = 4 d1 = 3 d1 = 2 0000 1110 d = 4 1111 0001 0010 0011 1100 1101 0100 0101 0110 0111 1010 1011 1000 1001 d1 = 3 d1 = 4 d1 = 3 rec 10 rec 13 rec 1 rec 4 rec 2 rec 3 rec 5 rec 7 rec 8 rec 11 rec 12 rec 14 rec 15

Similar presentations

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google