Variance of storage requirements for B+-trees

DOI10.1007/BF01186643zbMath0834.68014OpenAlexW2015854829MaRDI QIDQ1902301

W. Wesley Peterson

Publication date: 20 November 1995

Published in: Acta Informatica (Search for Journal in Brave)

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

zbMATH Keywords

\(B\)-trees\(B+\)-treeleaf nodes

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Related Items (1)

Phase changes in randomm-ary search trees and generalized quicksort

Cites Work

• Unnamed Item
• Unnamed Item
• Expected behaviour of \(B^+\)-trees under random insertions
• On random 2-3 trees
• Asymptotic Normality in the Generalized Polya–Eggenberger Urn Model, with an Application to Computer Data Structures
• The theory of fringe analysis and its application to 23 trees and b-trees

This page was built for publication: Variance of storage requirements for B+-trees