Article

Free access

Compact B-trees

Authors:

Arnold L. Rosenberg,

Lawrence SnyderAuthors Info & Claims

SIGMOD '79: Proceedings of the 1979 ACM SIGMOD international conference on Management of data

Pages 43 - 51

https://doi.org/10.1145/582095.582102

Published: 30 May 1979 Publication History

PDF eReader

Abstract

A B-tree is compact if it is minimal in number of nodes, hence has optimal space utilization, among equally capacious B-trees of the same order. The space utilization of compact B-trees is analyzed and is compared with that of noncompact B-trees and of (node)-visit-optimal B-trees, which minimize the expected number of nodes visited per key access. Compact B-trees can be as much as a factor of 2.5 more space-efficient than visit-optimal B-trees; and the node-visit cost of a compact tree is never more than 1 + the node-visit cost of an optimal tree. Finally, an in-place compactification algorithm is presented which operates in linear time in the size of the file.

References

[1]

R. Bayer and E. McCreight. Organization and maintenance of large ordered indexes. Acta Informatica 1 (3), 1972.

Digital Library

Google Scholar

[2]

R. Bayer and K. Unterauer. Prefix B-trees. IBM Technical Report RJ1796, 1976.

Google Scholar

[3]

D. E. Knuth. The Art of Computer Programming, Volume 3. Addison-Wesley, 1973.

Digital Library

Google Scholar

[4]

R. E. Miller, N. Pippenger, A. L. Rosenberg, and L. Snyder. Optimal 2,3-trees. SIAM Journal of Computing 8(1), February 1979, pp. 42--59.

Google Scholar

[5]

A. L. Rosenberg and L. Snyder. Minimal comparison 2,3-trees. SIAM Journal of Computing 7(4), November 1978, pp. 465--480.

Crossref

Google Scholar

[6]

L. Snyder. On uniquely represented data structures. Proceedings of the 18th Annual Conference on the Foundations of Computer Science, 1977.

Google Scholar

[7]

A. C. Yao. On random 2,3-trees. Acta Informatica 9:159--170, 1978.

Digital Library

Google Scholar

Cited By

View all

Brown T(2014)B-slack Trees: Space Efficient B-TreesAlgorithm Theory – SWAT 201410.1007/978-3-319-08404-6_11(122-133)Online publication date: 2014
https://doi.org/10.1007/978-3-319-08404-6_11
Arnow DTenenbaum AWu CTague J(1985)P-treesProceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval10.1145/253495.253516(111-121)Online publication date: 5-Jun-1985
https://dl.acm.org/doi/10.1145/253495.253516
Ouksel MScheuermann P(1981)MultidimensionalB-trees: Analysis of dynamic behaviorBIT10.1007/BF0193283821:4(401-418)Online publication date: Dec-1981
https://doi.org/10.1007/BF01932838
Show More Cited By

Compact B-trees
1. Information systems
  1. Information storage systems
    1. Record storage systems
      1. Directory structures
2. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory

Recommendations

Prefix B-trees

Two modifications of B-trees are described, simple prefix B-trees and prefix B-trees. Both store only parts of keys, namely prefixes, in the index part of a B^*-tree. In simple prefix B-trees those prefixes are selected carefully to minimize their length. ...
An empirical comparison of B-trees, compact B-trees and multiway trees
SIGMOD '84: Proceedings of the 1984 ACM SIGMOD international conference on Management of data

It is well-known that the B-tree data structure yields excellent worst-case search costs and for that reason is widely employed in the organization of external files and in the implementation of data bases. In this paper, we examine general B-trees ...
An empirical comparison of B-trees, compact B-trees and multiway trees

It is well-known that the B-tree data structure yields excellent worst-case search costs and for that reason is widely employed in the organization of external files and in the implementation of data bases. In this paper, we examine general B-trees ...

Comments

Information & Contributors

Information

Published In

SIGMOD '79: Proceedings of the 1979 ACM SIGMOD international conference on Management of data

May 1979

208 pages

ISBN:089791001X

DOI:10.1145/582095

General Chair:
James B. Rothnie
Computer Corporation of America
,
Program Chair:
Philip A. Bernstein
Harvard University

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 May 1979

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
643
Total Downloads

Downloads (Last 12 months)77
Downloads (Last 6 weeks)15

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Brown T(2014)B-slack Trees: Space Efficient B-TreesAlgorithm Theory – SWAT 201410.1007/978-3-319-08404-6_11(122-133)Online publication date: 2014
https://doi.org/10.1007/978-3-319-08404-6_11
Arnow DTenenbaum AWu CTague J(1985)P-treesProceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval10.1145/253495.253516(111-121)Online publication date: 5-Jun-1985
https://dl.acm.org/doi/10.1145/253495.253516
Ouksel MScheuermann P(1981)MultidimensionalB-trees: Analysis of dynamic behaviorBIT10.1007/BF0193283821:4(401-418)Online publication date: Dec-1981
https://doi.org/10.1007/BF01932838
Gudes ETsur SSprowls RChen P(1980)Experiments with B-tree reorganizationProceedings of the 1980 ACM SIGMOD international conference on Management of data10.1145/582250.582281(200-206)Online publication date: 14-May-1980
https://dl.acm.org/doi/10.1145/582250.582281

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

Prefix B-trees

An empirical comparison of B-trees, compact B-trees and multiway trees

An empirical comparison of B-trees, compact B-trees and multiway trees

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Recommendations

Prefix B-trees

An empirical comparison of B-trees, compact B-trees and multiway trees

An empirical comparison of B-trees, compact B-trees and multiway trees

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations