Buffered partially-persistent external-memory search trees

DOI10.4230/LIPICS.ESA.2025.82MaRDI QIDQ7322490zbMATH OpenFDO

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

Publication date 31 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2025.82

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Batched dynamic solutions to decomposable searching problems
• Cache-oblivious algorithms
• External memory fully persistent search trees
• External-memory algorithms for processing line segments in geographic information systems
• External-memory dictionaries with worst-case update cost
• Flushing Without Cascades
• scientific article; zbMATH DE number 3716801 (Why is no real title available?)
• scientific article; zbMATH DE number 2079384 (Why is no real title available?)
• scientific article; zbMATH DE number 1445387 (Why is no real title available?)
• I/O-efficient generation of massive graphs following the \textit{LFR} benchmark
• I/O-efficient point location using persistent B-trees
• Making data structures persistent
• On the limits of cache-obliviousness
• Organization and maintenance of large ordered indexes
• Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract)
• Retroactive data structures
• The buffer tree: A technique for designing batched external data structures
• The design of dynamic data structures

This page was built for publication: Buffered partially-persistent external-memory search trees

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