September 1992
Intermediate to advanced
1070 pages
41h 48m
English
15.2. Overview of Techniques to Implement Associative Access Paths
15.3. Associative Access by Hashing
15.3.1. Folding the Key Value into a Numerical Data Type
15.3.2. Criteria for a Good Hash Function
15.3.2.1. The Image Set of the Hashing Function
15.3.2.2. How to Find a Hash Function
15.3.2.3. Estimating the Probability of Page Overflows Due to Collisions
15.3.3. Overflow Handling in Hash Files
Read now
Unlock full access