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)
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Multi-table search for B-tree files
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Bounded index exponential hashing
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
A new tree index organization for files, capable of efficiently supporting both random and sequential access, is introduced. The organization, called digital B-tree (DB-tree), is similar in many aspects to B-trees. Its advantage is that it permits much larger fanout per node, thus reducing the height of the tree for a given file size. The effect of this is to reduce the cost of a random access to the file. The fanout of DB-tree nodes is increased substantially by permitting multiple page nodes. The unique advantage of DB-trees is that only one page of the node need ever be examined for each data access. This is accomplished by using the bits of the key to compute which page of the node is desired, in a way similar to the technique used in extendible hashing, but without performing a hashing operation. The DB-tree organization is described and analyzed. Particular algorithms are suggested for searching, building, and maintaining DB-trees.