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

DOI10.1142/S0129054117500101MaRDI QIDQ4977892zbMATH OpenFDO

Authors George Lagogiannis

Publication date 17 August 2017

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

Full work available at URL https://doi.org/10.1142/S0129054117500101

zbMATH Keywords

B-treesnode-copyingpartial persistenceworst-case update time

Mathematics Subject Classification ID

Data structures (68P05)

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

Cites work

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

Cited in

(3)

• Fully persistent B-trees
• Partially persistent B-trees with constant worst case update time
• Fully persistent B-trees

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)