Abstract
In this paper we describe a dynamic external memory data structure that supports range reporting queries in three dimensions in O(logB2 N + k/B) I/O operations, where k is the number of points in the answer and B is the block size. Our data structure uses O(N/B log 22 N log22 B) blocks of space and supports updates in amortized I/Os. This is the first dynamic data structure that answers three-dimensional range reporting queries in logBO(1) N + O(k/B) I/Os. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Nekrich, Y. (2010). Dynamic range reporting in external memory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6507 LNCS, pp. 25–36). https://doi.org/10.1007/978-3-642-17514-5_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
