The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
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)
A high performance, universal, key associative access method
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
The Bounded Disorder Access Method
Proceedings of the Second International Conference on Data Engineering
Spiral Storage: Incrementally Augmentable Hash Addressed Storage
Spiral Storage: Incrementally Augmentable Hash Addressed Storage
A simple bounded disorder file organization with good performance
ACM Transactions on Database Systems (TODS)
Twin grid files: space optimizing access schemes
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Retrieval performance versus disc space utilization on WORM optical discs
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Access methods for multiversion data
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
The hB-tree: a multiattribute indexing method with good guaranteed performance
ACM Transactions on Database Systems (TODS)
A compendium of key search references
ACM SIGIR Forum
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Performance analysis of file organizations that use multibucket data leaves with partial expansions
ACM Transactions on Database Systems (TODS)
Analysis of bounded disorder file organization
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A multivariate view of random bucket digital search trees
Journal of Algorithms - Analysis of algorithms
Performance of B±Trees with Partial Expansions
IEEE Transactions on Knowledge and Data Engineering
New Order Preserving Access Methods for Very Large Files Derived from Linear Hashing
IEEE Transactions on Knowledge and Data Engineering
Bounded Disorder File Organization
IEEE Transactions on Knowledge and Data Engineering
Probabilistic Model and Optimal Reorganization of B+-Tree with Physical Clustering
IEEE Transactions on Knowledge and Data Engineering
Linear Spiral Hashing for Expansible Files
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
B-tries for disk-based string management
The VLDB Journal — The International Journal on Very Large Data Bases
The HV-tree: a memory hierarchy aware version index
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
A new way to increase file space in dynamically growing files is introduced in which substantial improvement in file utilization can be achieved. It makes use of partial expansions in which, instead of doubling the space associated with some part of the file, the space grows at a slower rate. Unlike previous versions of partial expansion in which the number of buckets involved in file growth is increased by less than a factor of two, the new method expands file space by increasing bucket size via “elastic buckets.” This permits partial expansions to be used with a wide range of indexed files, including B-trees. The results of using partial expansions are analyzed, and the analysis confirmed by a simulation study. The analysis and simulation demonstrate that the file utilization gains are substantial and that fears of excessive insertion cost resulting from more frequent file growth are unfounded.