Dynamic Indexability and the Optimality of B-Trees

DOI10.1145/2339123.2339129zbMath1281.68100OpenAlexW1966484605MaRDI QIDQ5395690

Ke Yi

Publication date: 17 February 2014

Published in: Journal of the ACM (Search for Journal in Brave)

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

zbMATH Keywords

lower boundrange queryB-treesindexabilitydynamization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

Related Items (3)

I/O-efficient 2-d orthogonal range skyline and attrition priority queues ⋮ Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines ⋮ Fully persistent B-trees

This page was built for publication: Dynamic Indexability and the Optimality of B-Trees