Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

ISAAC
2005
Springer

favoriteEmaildiscussreport

90views Algorithms» more ISAAC 2005»

Approximate Colored Range Queries

13 years 9 months ago

Approximate Colored Range Queries

Download www.cs.cityu.edu.hk

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 eﬃcient data structures that provide approximate solutions to these problems. In addition, the framework can be employed to attack other related problems by ﬁnding the appropriate summary structures.

Ying Kit Lai, Chung Keung Poon, Benyun Shi

Real-time Traffic

Appropriate Sketching Techniques | ISAAC 2005 | Multi-dimensional Range Queries | Range Query Problems |

claim paper

Related Content

» Colored Range Queries and Document Retrieval

» Approximating the selectivity of multimedia range queries

» Approximate Range Mode and Range Median Queries

» Range Minima Queries with Respect to a Random Permutation and Approximate Range Counting

» Range aggregate structures for colored geometric objects

» A general approach for cacheoblivious range reporting and approximate range counting

» Searching for Frequent Colors in Rectangles

» Data Structures for Range Aggregation by Categories

» Approximate Evaluation of Range Nearest Neighbor Queries with Quality Guarantee

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	ISAAC
Authors	Ying Kit Lai, Chung Keung Poon, Benyun Shi

Comments (0)