Approximate colored range and point enclosure queries

Authors:
Ying Kit Lai;Chung Keung Poon;Benyun Shi
Affiliations:
Department of Computer Science, City U. of Hong Kong, China;Department of Computer Science, City U. of Hong Kong, China;Department of Computer Science, City U. of Hong Kong, China
Venue:
Journal of Discrete Algorithms
Year:
2008

Citing 14
Cited 4

New data structures for orthogonal range queries

SIAM Journal on Computing
Adding range restriction capability to dynamic data structures

Journal of the ACM (JACM)
Functional approach to data structures and its use in multidimensional searching

SIAM Journal on Computing
The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Further results on generalized intersection searching problems: counting, reporting, and dynamization

Journal of Algorithms
Multidimensional divide-and-conquer

Communications of the ACM
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
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Range Searching in Categorical Data: Colored Range Searching on Grid

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Comparing data streams using Hamming norms (how to zero in)

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
A dichromatic framework for balanced trees

SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Approximate colored range queries

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Counting colours in compressed strings

CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Dynamic range majority data structures

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Colored range queries and document retrieval

Theoretical Computer Science
Better space bounds for parameterized range majority and minority

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we formulate two classes of problems, the colored range query problems and the colored point enclosure query problems to model multi-dimensional range and point enclosure queries in the presence of categorical information. Many of these problems are difficult to solve using traditional data structural techniques. Based on a new framework of combining sketching techniques and traditional data structures, we obtain two sets of results in solving the problems approximately and efficiently. In addition, the framework can be employed to attack other related problems by finding the appropriate summary structures.