The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Bounded index exponential hashing
ACM Transactions on Database Systems (TODS)
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Spiral Storage: Incrementally Augmentable Hash Addressed Storage
Spiral Storage: Incrementally Augmentable Hash Addressed Storage
Balanced multidimensional extendible hash tree
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Partial expansions for file organizations with an index
ACM Transactions on Database Systems (TODS)
A simple bounded disorder file organization with good performance
ACM Transactions on Database Systems (TODS)
A multikey hashing scheme using predicate trees
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
A Mapping Function for the Directory of a Multidimensional Extendible Hashing
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
A new file organization is proposed that combines the advantages of digital B-trees and extendible hashing methods into one organization that can be used universally. The method, like these predecessors, relies on digital searching. The key notions are: (i) that multipage nodes are addressed by the root and can have both data and index entries, the mix of entries changing over time; and (ii) that these nodes can be doubled with file growth and, when this occurs, data nodes at the next level of the tree are absorbed into the pages of these nodes, frequently keeping data closer to the root and simultaneously improving utilization. The result is an unbalanced tree that we call a digital lopsided tree or DL-tree. The paper describes DL-trees and their operations, and examines their properties. The most important engineering issues involve the doubling process and the methods used to optimize the tree properties. Ways of dealing with these issues are suggested.