Dynamic Range Reporting in External Memory
Yakov Nekrich

TL;DR
This paper introduces a novel dynamic external memory data structure for efficient three-dimensional range reporting queries, achieving optimal I/O performance with minimal overhead.
Contribution
It presents the first dynamic data structure for 3D range reporting that operates in logarithmic I/O complexity with respect to block size and data size.
Findings
Supports range reporting in 3D with optimal I/O complexity
First dynamic structure achieving these bounds in external memory
Operates efficiently with minimal I/O overhead for large datasets
Abstract
In this paper we describe a dynamic external memory data structure that supports range reporting queries in three dimensions in I/O operations, where is the number of points in the answer and is the block size. This is the first dynamic data structure that answers three-dimensional range reporting queries in I/Os.
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
TopicsAlgorithms and Data Compression · Advanced Data Storage Technologies · Complexity and Algorithms in Graphs
