Modeling splits in file structures

DOI10.1007/BF00289146zbMath0648.68023OpenAlexW2057082976MaRDI QIDQ1105353

Ricardo A. Baeza-Yates

Publication date: 1989

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

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

zbMATH Keywords

analysis of algorithmssplittingoverflowsfile structuresB-treesdynamic hashing

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

Related Items (4)

The average height of a node in the BANG abstract directory tree ⋮ Bounded disorder: The effect of the index ⋮ Analysis of bounded disorder ⋮ Fast String Matching in Stationary Ergodic Sources

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
• The Analysis of an Improved Symmetric Binary B-tree Algorithm
• Dense multiway trees
• Kantorovich-Type Inequalities
• The theory of fringe analysis and its application to 23 trees and b-trees

This page was built for publication: Modeling splits in file structures