B-trees with lazy parent split

DOI10.1016/0020-0255(94)90040-XzbMATH Open0809.68061OpenAlexW2029250304MaRDI QIDQ1331024FDOQ1331024

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

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

zbMATH Keywords

\(B\)-treesdeletion algorithms

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The theory of fringe analysis and its application to 23 trees and b-trees
• Organization and maintenance of large ordered indexes
• Title not available (Why is that?)
• Time- and space-optimality in B-trees
• Operation-specific locking in balanced structures
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Lazy tree splitting
• 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)