Partially persistent B-trees with constant worst case update time

DOI10.1007/978-90-481-9794-1_1MaRDI QIDQ4932635zbMATH OpenOpenAlexFDO

Authors George Lagogiannis, Nikos A. Lorentzos

Publication date 6 October 2010

Published in Lecture Notes in Electrical Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-90-481-9794-1_1

zbMATH Keywords

algorithmsdata structuresindexing structurespersistence

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15) Nonnumerical algorithms (68W05)

Recommendations

• Query-optimal partially persistent B-trees with constant worst-case update time
• Fully persistent B-trees
• Fully persistent B-trees
• Making data structures persistent
• A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME

Cited in

(5)

• Fully persistent B-trees
• Cache-oblivious persistence
• scientific article; zbMATH DE number 1375590 (Why is no real title available?)
• Query-optimal partially persistent B-trees with constant worst-case update time
• Fully persistent B-trees

This page was built for publication: 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 Q4932635)