Bounded disorder: The effect of the index

DOI10.1016/S0304-3975(96)00061-8MaRDI QIDQ1350992zbMATHOpenAlexFDO

Authors Ricardo Baeza-Yates

Publication date 27 February 1997

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(96)00061-8

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Recommendations

• Analysis of bounded disorder
• A simple bounded disorder file organization with good performance
• Optimal bounded disorder.
• Memory management for B-trees
• Batched search of index sequential files

Cites work

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

Cited in

(5)

• A simple bounded disorder file organization with good performance
• Analysis of bounded disorder
• Bounded disorder: The effect of the index
• ISB-tree: A new indexing scheme with efficient expected behaviour
• Optimal bounded disorder.

This page was built for publication: Bounded disorder: The effect of the index

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1350992)