Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Filtering search: a new approach to query answering
SIAM Journal on Computing
Functional approach to data structures and its use in multidimensional searching
SIAM Journal on Computing
Efficient data structures for range searching on a grid
Journal of Algorithms
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Dynamic Perfect Hashing: Upper and Lower Bounds
SIAM Journal on Computing
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Multidimensional divide-and-conquer
Communications of the ACM
Internet packet filter management and rectangle geometry
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Two-dimensional substring indexing
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient algorithms for document retrieval problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Data Structures and Algorithms
Data Structures and Algorithms
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
New data structures for orthogonal range searching
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines
Information Processing Letters
A new framework for addressing temporal range queries and some preliminary results
Theoretical Computer Science
Approximate colored range and point enclosure queries
Journal of Discrete Algorithms
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines
Information Processing Letters
Finding Patterns In Given Intervals
Fundamenta Informaticae
Efficient non-intersection queries on aggregated geometric data
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Approximate colored range queries
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Top-K color queries for document retrieval
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Techniques for indexing and querying temporal observations for a collection of objects
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Space-efficient range reporting for categorical data
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Colored range searching on internal memory
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part II
Finding patterns in given intervals
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Colored top-K range-aggregate queries
Information Processing Letters
Efficient range searching for categorical and plain data
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.01 |
Range searching, a fundamental problem in numerous applications areas, has been widely studied in computational geometry and spatial databases. Given a set of geometric objects, a typical range query asks for reporting all the objects that intersect a query object. However in many applications, including databases and network routing, input objects are partitioned into categories and a query asks for reporting the set of categories of objects that intersect a query object. Moreover in many such applications, objects lie on a grid. We abstract the category of an object by associating a color with each object. In this paper, we present efficient data structures for solving the colored range-searching and colored point-enclosure problem on U 脳 U grid. Our data structures use near- linear space and answer a query in O(log log U + k) time, where k is the output size. As far as we know, this is the first result on colored range-searching for objects lying on a grid.