External Memory Orthogonal Range Reporting with Fast Updates
Yakov Nekrich

TL;DR
This paper introduces external memory data structures for orthogonal range reporting that achieve fast query and update times, matching or closely approximating the best existing solutions.
Contribution
It presents new external memory data structures that support efficient orthogonal range reporting with fast updates, improving upon previous methods.
Findings
Query costs match the best known structures
Update operations are performed efficiently
Achieves near-optimal performance in external memory
Abstract
In this paper we describe data structures for orthogonal range reporting in external memory that support fast update operations. The query costs either match the query costs of the best previously known data structures or differ by a small multiplicative factor.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Algorithms and Data Compression · Advanced Database Systems and Queries
