The SB-tree: An index-sequential structure for high-performance sequential access

DOI10.1007/BF01185680MaRDI QIDQ1813013zbMATH OpenOpenAlexWikidataFDO

Authors Patrick E. O'Neil

Publication date 25 June 1992

Published in Acta Informatica (Search for Journal in Brave)

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

zbMATH Keywords

\(B\)-treedisk accesslong range retrievals

Mathematics Subject Classification ID

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

Review text

See the preview in Zbl 0732.68032.

Cites work

• A simple bounded disorder file organization with good performance
• Distribution Design of Logical Database Schemas
• Expected behaviour of \(B^+\)-trees under random insertions
• scientific article; zbMATH DE number 3653523 (Why is no real title available?)
• Organization and maintenance of large ordered indexes
• Unsafe operations in B-trees

Cited in

(3)

• Algorithms and Computation
• ISB-tree: A new indexing scheme with efficient expected behaviour
• More modern b-tree techniques

This page was built for publication: The SB-tree: An index-sequential structure for high-performance sequential access

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