Modeling B-tree insertion activity

DOI10.1016/0020-0190(87)90029-9zbMath0639.68109OpenAlexW2021961695MaRDI QIDQ1099971

LeRoy A. Franklin, Sheau-Dong Lang, James R. Driscoll

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90029-9

zbMATH Keywords

binomial distributionreorganizationbeta-functionspace utilizationB-treesoptimal retrieval performanceroot node insertiontree structured file

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (1)

\(B\)-trees with inserts and deletes: Why free-at-empty is better than merge-at-half

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Space utilization and access path length in B-trees
• On random 2-3 trees
• Organization and maintenance of large ordered indexes
• Height-balanced trees of order (β, γ, δ)
• Time- and space-optimality in B-trees
• Optimal 2,3-Trees

This page was built for publication: Modeling B-tree insertion activity