BLEH: Bit-Less Extendible Hashing for DBMS and Hard Disk Drives

  • Sridevi* G
  • et al.
Citations of this article
Mendeley users who have this article in their library.
Get full text


Indexing techniques such as extendible hashing and B-trees are widely used to store, retrieve and search for data on files in most file systems. These techniques have been comprehensively explored to enhance the data structure for increasing the faster access to file contents. Extendible hashing is a dynamic hashing technique which handles dynamic files that keep changing in size. Traditional extendible hashing uses bit addresses to hash the data to buckets and restricts the directory size to be a power of 2 which has corresponding complications in implementation. Restriction on directory size also results in uneven distribution of data which increases the possibility of overflows. This in turn increases the cost of index maintenance. In this paper, an efficient and simpler to implement variation of Extendible hashing method named Bit-Less Extendible Hashing (BLEH) for dynamic files is proposed. The proposed method eliminates the need for binary representation of the hash address which reduces the complexity of implementation. Furthermore, it eliminates the need for the directory size to be a power of 2 providing flexibility in the choice of initial directory size. The experimental results show that the proposed method provides better performance in terms of split count upon insertion when compared to the traditional extendible hashing method with good space utilization.




Sridevi*, G. M., & Ashoka, Dr. D. V. (2019). BLEH: Bit-Less Extendible Hashing for DBMS and Hard Disk Drives. International Journal of Innovative Technology and Exploring Engineering, 9(2), 2191–2197.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free