Maximizing the optimality streak of deferred data structuring (a.k.a. database cracking)

DOI10.4230/LIPICS.ICDT.2025.10MaRDI QIDQ7292776zbMATH OpenFDO

Authors Yufei Tao

Publication date 8 July 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICDT.2025.10

Mathematics Subject Classification ID

Database theory (68P15)

Cites work

• Approximate nearest neighbor search for low-dimensional queries
• Computational geometry. Algorithms and applications.
• Deferred data structure for the nearest neighbor problem
• Deferred Data Structuring
• Dynamic deferred data structuring
• Efficient worst-case data structures for range searching
• scientific article; zbMATH DE number 6469222 (Why is no real title available?)
• Lazy search trees
• Maintenance of configurations in the plane
• Near-optimal online multiselection in internal and external memory
• Optimal deterministic algorithms for 2-d and 3-d shallow cuttings
• Optimal Search in Planar Subdivisions
• Range Medians
• Selectable heaps and optimal lazy search trees
• The complexity of selection and ranking in X+Y and matrices with sorted columns
• The power of geometric duality
• The Ultimate Planar Convex Hull Algorithm?
• Time bounds for selection
• Towards optimal range medians
• Towards Optimal Range Medians

Cited in

(1)

• Lazy B-trees

This page was built for publication: Maximizing the optimality streak of deferred data structuring (a.k.a. database cracking)

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