P-trees: storage efficient multiway trees

Authors:
David M. Arnow;Aaron M. Tenenbaum;Connie Wu
Affiliations:
Department of Computer and Information Science, Brooklyn College, City University of New York;Department of Computer and Information Science, Brooklyn College, City University of New York;Department of Computer and Information Science, Brooklyn College, City University of New York
Venue:
SIGIR '85 Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval
Year:
1985

Citing 6
Cited 1

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Time- and space-optimality in B-trees

ACM Transactions on Database Systems (TODS)
Dense multiway trees

ACM Transactions on Database Systems (TODS)
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
Compact B-trees

SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Experiments with B-tree reorganization

SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data

B-tries for disk-based string management

The VLDB Journal — The International Journal on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new variation of high order multiway tree structures, the P-tree is presented. P-trees have average access costs that are significantly better than those of B-trees and are no worse (and often better) in storage utilization. Unlike compact B-trees, they can be maintained dynamically, and unlike dense multiway trees and B-trees, their associated insertion algorithm, which is also presented, is cheap and involves (at most) a very localized rearrangement of keys.