skip to main content
article
Free access

Partial expansions for file organizations with an index

Published: 01 March 1987 Publication History

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.

References

[1]
BAYER, R., AND MCCREIGHT, E.M. Organization and maintenance of large ordered indices. Acta Inf. I, 3 (1972), 173-189.
[2]
FAGIN, R., NIEVERGELT, J, PIPPENGER, N., AND STRONG, H.R. Extendible hashing--A fast access method for dynamic files. ACM Trans. Database Syst. 4, 3 (Sept. 1979), 315-344.
[3]
KNUTH, D. The Art of Computer Programming. Vol. 3, Sorting and Searching. Addison-Wesley, Reading, Mass., 1973.
[4]
LARSON, P. Linear hashing with partial expansions. In Proceedings of the 6th Conference on Very Large Data Bases (Montreal). 1980, pp. 224-232.
[5]
LITWIN, W. Virtual hashing: A dynamically changing hashing. In Proceedings of the 4th Conference on Very Large Data Bases (Berlin). 1978, pp. 517-523.
[6]
LITWIN, W. Linear hashing: A new tool for file and table addressing. In Proceedings of the 6th Conference on Very Large Data Bases (Montreal). 1980, pp. 212-223.
[7]
LITWIN, W., AND LOMET, D. The bounded disorder access method. In Proceedings of the 2nd Conference on Data Engineering (Los Angeles). 1986, pp. 38-48.
[8]
LOMET, D.B. Digital B-trees. In Proceedings of the 7th International Conference on Very Large Data Bases (Cannes). 1981, pp. 333-344.
[9]
LOMET, D.B. Bounded index exponential hashing.ACM Trans. Database Syst. 8, 1 (Mar. 1983), 136-165.
[10]
LOMET, D.B. A high performance, universal, key associative access method. In Proceedings of the ACM SIGMOD Conference on Management of Data (San Jose, Calif.). 1983, ACM, New York, pp. 120-133.
[11]
LOMET, D.B. A simple bounded disorder file organization with good performance. Tech. Pep. TR-86-13 (submitted for publication), Wang Institute {Sept. 1986).
[12]
MA~tTIN, G. Spiral storage: Incrementally augmentable hash addressed storage. Theory of Comput. Rep. 27, Univ. of Warwick, Coventry.
[13]
YAo, A. C. -C. Random 3-2 trees. Acta Inf. 9 (1978), 159-170.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Database Systems
ACM Transactions on Database Systems  Volume 12, Issue 1
March 1987
136 pages
ISSN:0362-5915
EISSN:1557-4644
DOI:10.1145/12047
  • Editor:
  • Robert W. Taylor
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1987
Published in TODS Volume 12, Issue 1

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)37
  • Downloads (Last 6 weeks)13
Reflects downloads up to 15 Sep 2024

Other Metrics

Citations

Cited By

View all
  • (2022)Demonstration of accelerating machine learning inference queries with correlative proxy modelsProceedings of the VLDB Endowment10.14778/3554821.355488715:12(3734-3737)Online publication date: 1-Aug-2022
  • (2021)The art of balanceProceedings of the VLDB Endowment10.14778/3476311.347637814:12(2999-3013)Online publication date: 28-Oct-2021
  • (2020)LeaperProceedings of the VLDB Endowment10.14778/3407790.340780313:12(1976-1989)Online publication date: 1-Jul-2020
  • (2020)Data market platformsProceedings of the VLDB Endowment10.14778/3407790.340780013:12(1933-1947)Online publication date: 14-Sep-2020
  • (2020)ALEX: An Updatable Adaptive Learned IndexProceedings of the 2020 ACM SIGMOD International Conference on Management of Data10.1145/3318464.3389711(969-984)Online publication date: 11-Jun-2020
  • (2010)The HV-treeProceedings of the VLDB Endowment10.14778/1920841.19208943:1-2(397-408)Online publication date: 1-Sep-2010
  • (2010)Parsimonious linear fingerprinting for time seriesProceedings of the VLDB Endowment10.14778/1920841.19208933:1-2(385-396)Online publication date: 1-Sep-2010
  • (2010)Retrieving top-k prestige-based relevant spatial web objectsProceedings of the VLDB Endowment10.14778/1920841.19208913:1-2(373-384)Online publication date: 1-Sep-2010
  • (2009)Tuning database configuration parameters with iTunedProceedings of the VLDB Endowment10.14778/1687627.16877672:1(1246-1257)Online publication date: 1-Aug-2009
  • (2009)B-tries for disk-based string managementThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-008-0094-118:1(157-179)Online publication date: 1-Jan-2009
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media