Some average performance measures for the B-tree

DOI10.1007/BF00289710MaRDI QIDQ797287zbMATH OpenOpenAlexFDO

Authors William E. Wright

Publication date 1985

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00289710

zbMATH Keywords

indexesfile organizationaverage performance measuresaverage storage utilizationlarge B-treesmultiway trees

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05) Searching and sorting (68P10)

Recommendations

• A model of the dynamic behavior of B-trees
• Expected behaviour of \(B^+\)-trees under random insertions
• Height-balanced trees of order (β, γ, δ)
• Modeling B-tree insertion activity
• Toward a formal derivation of the expected behavior of prefix B-trees

Cites work

• scientific article; zbMATH DE number 3648167 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• B-trees re-examined
• On random 2-3 trees
• Organization and maintenance of large ordered indexes
• Space utilization and access path length in B-trees
• Storage utilization in B*-trees with a generalized overflow technique

Cited in

(13)

• A uniform model for the storage utilization of B-tree-like structures
• scientific article; zbMATH DE number 3954287 (Why is no real title available?)
• scientific article; zbMATH DE number 3843183 (Why is no real title available?)
• Toward a formal derivation of the expected behavior of prefix B-trees
• Expected behaviour of \(B^+\)-trees under random insertions
• \(B\)-trees with inserts and deletes: Why free-at-empty is better than merge-at-half
• Height-balanced trees of order (β, γ, δ)
• Memory management for B-trees
• scientific article; zbMATH DE number 17553 (Why is no real title available?)
• A model of the dynamic behavior of B-trees
• The average height of a node in the BANG abstract directory tree
• Space saving generalization of \(B\)-trees with \(2/3\) utilization
• Variance of storage requirements for B+-trees

This page was built for publication: Some average performance measures for the B-tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797287)