Linear Hashing is a dynamically updateable disk-based index structure which implements a hashing scheme and which grows or shrinks one bucket at a time. The index is used to support exact match queries, i.e., find the record with a given key. Compared with the B+-tree index which also supports exact match queries (in logarithmic number of I/Os), Linear Hashing has better expected query cost O(1) I/O. Compared with Extendible Hashing, Linear Hashing does not use a bucket directory, and when an overflow occurs, it is not always the overflown bucket that is split. The name Linear Hashing is used because the number of buckets grows or shrinks in a linear fashion. Overflows are handled by creating a chain of pages under the overflown bucket. The hashing function changes dynamically and at any given instant there can be at most two hashing functions used by the scheme.
A hash table is an in-memory data structure that associates keys with values. The primary...
- 2.Litwin W. Linear hashing: a new tool for file and table addressing. In: Proceedings of the Sixth International Conference on Very Large Databases; 1980. p. 212–23.Google Scholar
- 4.Schneider DA., DeWitt DJ. Tradeoffs in processing complex join queries via hashing in multiprocessor database machines. In: Proceedings of the 16th International Conference on Very Large Databases; 1990. p. 469–80.Google Scholar