The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
System R: relational approach to database management
ACM Transactions on Database Systems (TODS)
Spiral Storage: Incrementally Augmentable Hash Addressed Storage
Spiral Storage: Incrementally Augmentable Hash Addressed Storage
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Partial expansions for file organizations with an index
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Concurrent search structure algorithms
ACM Transactions on Database Systems (TODS)
A simple bounded disorder file organization with good performance
ACM Transactions on Database Systems (TODS)
A compendium of key search references
ACM SIGIR Forum
Multidimensional access methods
ACM Computing Surveys (CSUR)
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Analysis of dynamic hashing with deferred splitting
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
A high performance, universal, key associative access method
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Linear Spiral Hashing for Expansible Files
IEEE Transactions on Knowledge and Data Engineering
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
A Mapping Function for the Directory of a Multidimensional Extendible Hashing
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
The hB $^\Pi$-tree: a multi-attribute index supporting concurrency, recovery and node consolidation
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
Bounded index exponential hashing, a new form of extendible hashing, is described. It has the important advantages over most of the other extendible hashing variants of both (i) providing random access to any record of a file in close to one disk access and (ii) having performance which does not vary with file size. It is straightforward to implement and demands only a fixed and specifiable amount of main storage to achieve this performance. Its underlying physical disk storage is readily managed and record overflow is handled so as to insure that unsuccessful searches never take more than two accesses. The method's ability to access data in close to a single disk access makes it possible to organize a database, in which files have a primary key and multiple secondary keys, such that the result is a significant performance advantage over existing organizations.