Query-optimal partially persistent B-trees with constant worst-case update time

DOI10.1142/S0129054117500101zbMATH Open1368.68189MaRDI QIDQ4977892FDOQ4977892

George Lagogiannis

Publication date: 17 August 2017

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Recommendations

• Partially persistent B-trees with constant worst case update time
• Fully persistent B-trees
• Fully persistent B-trees
• A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME
• Publication:4490355

zbMATH Keywords

B-treesnode-copyingpartial persistenceworst-case update time

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME

This page was built for publication: Query-optimal partially persistent B-trees with constant worst-case update time

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