Next: Dynamic Hashing
Up: Static Hashing
Previous: Handling of bucket overflows
A hash index organizes the search keys with their associated pointers into
a hash file structure.
We apply a hash function on a search key to identify a bucket, and store the
key and its associated pointers in the bucket (or in overflow buckets).
Strictly speaking, hash indices are only secondary index structures,
since if a file itself is organized using hashing, there is no need
for a separate hash index structure on it.
Mon Jul 13 13:28:03 PDT 1998