External memory fully persistent search trees

DOI10.1145/3564246.3585140MaRDI QIDQ6499312zbMATH OpenWikidataFDO

Authors Gerth Stølting Brodal, Casper Moldrup Rysgaard, Rolf Svenning

Publication date 8 May 2024

Full work available at URL https://doi.org/10.1145/3564246.3585140

zbMATH Keywords

external memoryrange queriesB-treesfull persistencesemi-dynamic ray shooting

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 4211552 (Why is no real title available?)
• scientific article; zbMATH DE number 6469156 (Why is no real title available?)
• A new data structure for representing sorted lists
• Dynamic Planar Point Location in External Memory.
• External memory planar point location with logarithmic updates
• Filtering Search: A New Approach to Query-Answering
• Flushing Without Cascades
• Fractional cascading. I: A data structuring technique
• Fully persistent B-trees
• Fully persistent B-trees
• I/O-efficient point location using persistent B-trees
• Making data structures persistent
• New Data Structures for Orthogonal Range Queries
• On the limits of cache-obliviousness
• Optimal External Memory Interval Management
• Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
• Organization and maintenance of large ordered indexes

This page was built for publication: External memory fully persistent search trees

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