Functional approach to data structures and its use in multidimensional searching
SIAM Journal on Computing
The input/output complexity of sorting and related problems
Communications of the ACM
Path caching (extended abstract): a technique for optimal external searching
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient 3-D range searching in external memory
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On two-dimensional indexability and optimal range search indexing
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The P-range tree: a new data structure for range searching in secondary memory
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
New data structures for orthogonal range searching
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Optimal External Memory Interval Management
SIAM Journal on Computing
On dynamic range reporting in one dimension
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Fully Dynamic Orthogonal Range Reporting on RAM
SIAM Journal on Computing
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Orthogonal Range Reporting in Three and Higher Dimensions
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
I/O-efficient point location in a set of rectangles
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Persistent predecessor search and orthogonal point location on the word RAM
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Space-efficient range reporting for categorical data
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Efficient range searching for categorical and plain data
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
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.