Design and implementation of a multi-dimensional extendible hashing scheme
Hashing techniques have enjoyed a major role in accessing data on secondary storage. Hashing, under slight constraints, provides access to records in constant time. Several hashing schemes have been proposed which eliminate the fixed file size requirement. This property has given these methods the general name Dynamic Hashing. These dynamic hashing schemes can be generalized to allow for multiple key access. Exact match queries can be satisfied in constant time. Such a file access method will be implemented and its performance compared with that of the indexed sequential with secondary indexing file organization.