More modern b-tree techniques

DOI10.1561/1900000070MaRDI QIDQ6599130zbMATH OpenFDO

Authors Goetz Graefe

Publication date 5 September 2024

Published in Foundations and Trends in Databases (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1561/1900000070

zbMATH Keywords

access method: indexingconcurrency controldatabase designrecoverystoragetransaction management

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05) Database theory (68P15)

Recommendations

• The log-structured merge-tree (LSM-tree)
• \(B\)-trees with lazy parent split
• Modeling B-tree insertion activity
• Belga B-trees
• scientific article; zbMATH DE number 3843183

Cites work

• Duplicate record elimination in large data files
• Efficient locking for concurrent operations on B-trees
• scientific article; zbMATH DE number 3653523 (Why is no real title available?)
• scientific article; zbMATH DE number 482761 (Why is no real title available?)
• The log-structured merge-tree (LSM-tree)
• The SB-tree: An index-sequential structure for high-performance sequential access

This page was built for publication: More modern b-tree techniques

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