Analysis of bounded disorder

DOI10.1007/3-540-58338-6_70zbMath1493.68127OpenAlexW1554745932MaRDI QIDQ5096880

Ricardo A. Baeza-Yates

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1994 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58338-6_70

Mathematics Subject Classification ID

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

Related Items (1)

Bounded disorder: The effect of the index

Cites Work

• Performance analysis of file organizations that use multi-bucket data leaves
• Modeling splits in file structures
• Expected behaviour of \(B^+\)-trees under random insertions
• On random 2-3 trees
• Bounded disorder: The effect of the index
• Computing the probability of hash table/urn overflow
• A simple bounded disorder file organization with good performance
• The theory of fringe analysis and its application to 23 trees and b-trees

This page was built for publication: Analysis of bounded disorder