Data Mgmt - 115 Hash-Based Indexing Level = 1 N = 4 h1 h0 000 00 64 Next = 1 001 01 9 010 10 10 011 11 31 100 00 25 5 15 7 44 3 63 Delete 44 Level

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Hash-Based Indexing 115 10 00 01 10 11 000 001 010 011 h h 0 1 64 92 5 5 Next = 1 31 15 7 3 63 00 100 44 Level = 1 , N = 4 Delete 44 10 00 01 10 11 000 001 010 011 h h 0 1 64 31 15 7 3 63 Level = 1 , N = 4 Next = 0 Figure 11.10
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
116 Chapter 11 Level = 2 , N = 4 10 64 92 5 5 h 1 00 01 10 h 0 0 0 1 Level = 1 , N = 2 Delete 31 19 h 2 000 001 010 011 10 64 31 Next = 0 h 1 00 01 10 11 19 481 6 6 Next = 1 Figure 11.11
Background image of page 2
Hash-Based Indexing
Background image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/17/2012 for the course EGN 4302 taught by Professor Dr.vishak during the Fall '12 term at University of Central Florida.

Page1 / 3

Data Mgmt - 115 Hash-Based Indexing Level = 1 N = 4 h1 h0 000 00 64 Next = 1 001 01 9 010 10 10 011 11 31 100 00 25 5 15 7 44 3 63 Delete 44 Level

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online