A log log n data structure for three-sided range queries
Information Processing Letters
The input/output complexity of sorting and related problems
Communications of the ACM
Surpassing the information theoretic bound with fusion trees
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
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
Optimal static range reporting in one dimension
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
External-Memory Breadth-First Search with Sublinear I/O
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Cache-oblivious data structures for orthogonal range searching
Proceedings of the nineteenth annual symposium on Computational geometry
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
New data structures for orthogonal range searching
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Cache-oblivious planar orthogonal range searching and counting
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Inverted files for text search engines
ACM Computing Surveys (CSUR)
Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching
Proceedings of the twenty-second annual symposium on Computational geometry
Type less, find more: fast autocompletion search with a succinct index
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Cell broadband engine architecture and its first implementation: a performance view
IBM Journal of Research and Development
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Efficient Breadth-First Search on the Cell/BE Processor
IEEE Transactions on Parallel and Distributed Systems
Cache-oblivious range reporting with optimal queries requires superlinear space
Proceedings of the twenty-fifth annual symposium on Computational geometry
Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Orthogonal Range Reporting in Three and Higher Dimensions
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
External memory range reporting on a grid
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
I/O-efficient point location in a set of rectangles
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Efficient processing of 3-sided range queries with probabilistic guarantees
Proceedings of the 13th International Conference on Database Theory
Fast prefix search in little space, with applications
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Using hashing to solve the dictionary problem
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Improved space bounds for cache-oblivious range reporting
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
I/O-efficient planar range skyline and attrition priority queues
Proceedings of the 32nd symposium on Principles of database systems
Efficient range searching for categorical and plain data
ACM Transactions on Database Systems (TODS)
Hi-index | 0.00 |
Motivated by information retrieval applications, we consider the one-dimensional colored range reporting problem in rank space. The goal is to build a static data structure for sets C1,...,Cm ⊆ {1,...,σ} that supports queries of the kind: Given indices a, b, report the set [EQUATION]. We study the problem in the I/O model, and show that there exists an optimal linear-space data structure that answers queries in O(1 + k/B) I/Os, where k denotes the output size and B the disk block size in words. In fact, we obtain the same bound for the harder problem of three-sided orthogonal range reporting. In this problem, we are to preprocess a set of n two-dimensional points in rank space, such that all points inside a query rectangle of the form [x1, x2] x (−∞, y] can be reported. The best previous bounds for this problem is either O(n lg2B n) space and O(1 + k/B) query I/Os, or O(n) space and O(lg(h)B n + k/B) query I/Os, where lg(h)B n is the base B logarithm iterated h times, for any constant integer h. The previous bounds are both achieved under the indivisibility assumption, while our solution exploits the full capabilities of the underlying machine. Breaking the indivisibility assumption thus provides us with cleaner and optimal bounds. Our results also imply an optimal solution to the following colored prefix reporting problem. Given a set S of strings, each O(1) disk blocks in length, and a function c: S → 2{1,...,σ}, support queries of the kind: Given a string p, report the set [EQUATION], where p* denotes the set of strings with prefix p. Finally, we consider the possibility of top-k extensions of this result, and present a simple solution in a model that allows non-blocked I/O.