Affiliation:
1. Wang Institute of Graduate Studies, Tyngboro, MA
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. ALEX: An Updatable Adaptive Learned Index;Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data;2020-06-11
2. The HV-tree;Proceedings of the VLDB Endowment;2010-09
3. B-tries for disk-based string management;The VLDB Journal;2008-03-11
4. Persistently cached B-trees;IEEE Transactions on Knowledge and Data Engineering;2003-05
5. A multivariate view of random bucket digital search trees;Journal of Algorithms;2002-07