lec16 - Outline Motivation: external memory model...

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

View Full Document Right Arrow Icon
Outline Motivation: external memory model Extendible Hashing: terms and definitions Operations Insertion Search Summary on Hashing Applications Lecture 16, Extendible Hashing p. 1
Background image of page 1

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

View Full DocumentRight Arrow Icon
Extendible Hashing: Motivation and Basic Ideas What if we cannot keep a hashtable inside memory: similar question we were asking for AVL trees. Solution: similar to ideas on b-trees, we split an overflow block View a key as a bit string Use the first k bits to determine the page Locate the key in the page Lecture 16, Extendible Hashing p. 2
Background image of page 2
Extendible Hashing: Definitions and Terms Two level searching structure First level, a dictionary: given the first k bits of a key, return a reference to a page. Second level, a page: given a reference, return the key in the page. Each page has a single reference, pointed by a record in the dictionary; multiple dic-
Background image of page 3

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

View Full DocumentRight Arrow Icon
Background image of page 4
Background image of page 5
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 5

lec16 - Outline Motivation: external memory model...

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

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