A uniform model for the storage utilization of B-tree-like structures

DOI10.1016/0020-0190(95)00189-1zbMath0900.68259OpenAlexW2007106239MaRDI QIDQ1350769

Renzo Sprugnoli, Donatella Merlini, M. Cecilia Verri

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00189-1

zbMATH Keywords

Riordan arraysAnalysis of algorithmsB-treesStorage utilization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Riordan matrices and higher-dimensional lattice walks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some average performance measures for the B-tree
• Expected behaviour of \(B^+\)-trees under random insertions
• Space utilization and access path length in B-trees
• The Riordan group
• Riordan arrays and combinatorial sums
• Singularity Analysis of Generating Functions
• Dynamic hashing

This page was built for publication: A uniform model for the storage utilization of B-tree-like structures