Fully persistent B-trees

DOI10.1016/j.tcs.2020.06.027zbMath1455.68046OpenAlexW3040250498MaRDI QIDQ2202015

Gerth Stølting Brodal, Konstantinos Tsakalidis, Spyros Sioutas, Kostas Tsichlas

Publication date: 17 September 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.06.027

zbMATH Keywords

range searchingbig dataexternal memorypersistent data structuresversioned databases

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15) Data structures (68P05) Information storage and retrieval of data (68P20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• ISB-tree: A new indexing scheme with efficient expected behaviour
• Maintaining order in a generalized linked list
• A balanced search tree O(1) worst-case update time
• Making data structures persistent
• A new data structure for representing sorted lists
• Organization and maintenance of large ordered indexes
• Symmetric binary B-trees: Data structure and maintenance algorithms
• Compressed Persistent Index for Efficient Rank/Select Queries
• Algorithms and Data Structures for External Memory
• Cache-Oblivious Persistence
• AVL-trees for localized search
• A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME
• Dynamic Indexability and the Optimality of B-Trees
• I/O-efficient point location using persistent B-trees

This page was built for publication: Fully persistent B-trees