Indexed extendible hashing

Abstract

In the context of very large databases, the main problem is how to access the relevant data blocks in a minimum amount of time to satisfy user queries. To speed up the retrieval operations on very large databases, we propose a hashing scheme named Indexed Extendible Hashing (IEH). IEH is a modification of the well-known Extendible Hashing (EH) scheme. Compared to the directory of EH, the directory of IEH is smaller and has better storage utilization when the distribution of the hashed attribute values is not uniform, and IEH provides a higher degree of concurrency.