Approximate colored range queries

Authors:
Ying Kit Lai;Chung Keung Poon;Benyun Shi
Affiliations:
Dept. of Computer Science, City U. of Hong Kong, China;Dept. of Computer Science, City U. of Hong Kong, China;Dept. of Computer Science, City U. of Hong Kong, China
Venue:
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Year:
2005

Citing 10
Cited 1

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
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
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 and point enclosure queries

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we formulate a class of colored range query problems to model the multi-dimensional range queries in the presence of categorical information. By applying appropriate sketching techniques on our framework, we obtained efficient data structures that provide approximate solutions to these problems. In addition, the framework can be employed to attack other related problems by finding the appropriate summary structures.