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.
Weitere Kapitel dieses Buchs durch Wischen aufrufen
- Approximate Colored Range Queries
Ying Kit Lai
Chung Keung Poon
- Springer Berlin Heidelberg