B-trees with lazy parent split

DOI10.1016/0020-0255(94)90040-XMaRDI QIDQ1331024zbMATH OpenOpenAlexFDO

Authors Y. Manolopoulos

Publication date 17 August 1994

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0255(94)90040-x

zbMATH Keywords

\(B\)-treesdeletion algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Database theory (68P15)

Recommendations

• Concurrent operations on \(B^ *\)-trees with overtaking
• scientific article; zbMATH DE number 2033285
• B-trees with inserts and deletes: Why free-at-empty is better than merge-at-half
• Unsafe operations in B-trees
• B-slack trees: space efficient B-trees

Cites work

• scientific article; zbMATH DE number 3843183 (Why is no real title available?)
• scientific article; zbMATH DE number 4033041 (Why is no real title available?)
• scientific article; zbMATH DE number 4088895 (Why is no real title available?)
• scientific article; zbMATH DE number 3653523 (Why is no real title available?)
• scientific article; zbMATH DE number 195030 (Why is no real title available?)
• Operation-specific locking in balanced structures
• Organization and maintenance of large ordered indexes
• The theory of fringe analysis and its application to 23 trees and b-trees
• Time- and space-optimality in B-trees

Cited in

(3)

• Lazy tree splitting
• More modern b-tree techniques
• Lazy tree splitting

This page was built for publication: \(B\)-trees with lazy parent split

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