Discussion 09 Linear Hashing, Sorting, HW3, and Project 3 University of Michigan - EECS 484

Document Content and Description Below

Linear Hashing, Sorting, HW3, and Project 3 Discussion 09EECS 484 Outline • Refresher on Linear Hashing • Sorting • Project 3 Overview 2EECS 484 Linear Hashing Refresher •Eliminates... long overflow chains without using a directory •Main idea: use a family of hash functions h0, h1, … •Splitting proceeds in rounds •Variables: •Level - initialized to 0 •Next - pointer to the next bucket to be split •N - the initial number of buckets [Show More]

Last updated: 1 year ago

Preview 1 out of 55 pages