External memory fully persistent search trees

DOI10.1145/3564246.3585140WikidataQ130957775 ScholiaQ130957775MaRDI QIDQ6499312

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

Publication date: 8 May 2024

zbMATH Keywords

external memoryrange queriesB-treesfull persistencesemi-dynamic ray shooting

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

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

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