A simple bounded disorder file organization with good performance

DOI10.1145/49346.50067zbMath0665.68010OpenAlexW1973922778MaRDI QIDQ3816963

David Bruce Lomet

Publication date: 1988

Published in: ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/49346.50067

zbMATH Keywords

extendible hashingdynamic hashingdynamic filesindexed filesaccess performanceB- trees

Mathematics Subject Classification ID

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

Related Items (7)

Bounded disorder: The effect of the index ⋮ Analysis of bounded disorder ⋮ ISB-tree: A new indexing scheme with efficient expected behaviour ⋮ Performance analysis of file organizations that use multi-bucket data leaves ⋮ Analysis of random probing hashing ⋮ The SB-tree: An index-sequential structure for high-performance sequential access ⋮ Optimal bounded disorder.

This page was built for publication: A simple bounded disorder file organization with good performance