Seeking a faster way to access dynamic files? This paper introduces extendible hashing, a novel approach guaranteeing data retrieval in just two page faults. Unlike traditional hashing, this method employs a dynamic structure that adapts effortlessly to database growth and shrinkage, a key consideration in **dynamic file systems**. The study bridges the gap between extendible hash tables and balanced radix search trees, offering an innovative access technique. The analysis and simulation showcase the technique’s performance under various conditions, highlighting its efficiency in rapidly locating data through **extendible hashing**. This research details the implementation and optimization of extendible hashing, showcasing its superiority in handling dynamic data structures and minimizing search times. Its dynamic nature provides a flexible framework for managing data efficiently. This research offers a promising alternative to conventional access methods, including balanced trees. By addressing the limitations of fixed-size hash tables, extendible hashing provides a scalable solution for databases requiring quick and efficient access to data. It paves the way for future advancements in database management and information retrieval, particularly for systems dealing with evolving datasets and the need for quick data location.
Published in ACM Transactions on Database Systems, this paper aligns with the journal's focus on innovative database solutions. By introducing extendible hashing, the paper addresses the challenges of efficiently managing dynamic files, a central theme in database research. The citations in the paper confirm its place within the field, highlighting its contribution to developing practical access methods.