Abstract
Aggregate window queries return summarized information about objects that fall inside a query rectangle (e.g., the number of objects instead of their concrete ids). Traditional approaches for processing such queries usually retrieve considerable extra information, thus compromising the processing cost. The paper addresses this problem for planar points from both theoretical and practical points of view. We show that, an aggregate window query can be answered in logarithmic worst-case time by an indexing structure called the aPtree. Next we study the practical behavior of the aP-tree and propose efficient cost models that predict the structure size and actual query cost. Extensive experiments show that the aP-tree, while involving more space consumption, accelerates query processing by up to an order of magnitude compared to a specialized method based on R-trees. Furthermore, our cost models are accurate and can be employed for the selection of the most appropriate method, balancing the space and query time tradeoff.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Becker, B., Gschwind, S., Ohler, T., Seeger, B., Widmayer, P. An Asymptotically Optimal Multiversion B-Tree. VLDB Journal, Vol. 5(4), pp. 264–275, 1996.
Beckmann, B., Kriegel, H.P., Schneider, R, Seeger, B. The R*-tree: An Efficient and Robust Access Method. ACM SIGMOD, 1990.
Bercken van den, J., Seeger, B. Query Processing Techniques for Multiversion Access Methods. VLDB, 1996.
Jurgens, M., Lenz, H. The Ra*-tree: An Improved R-tree with Materialized Data for Supporting Range Queries on OLAP-Data. DEXA Workshop, 1998.
Kamel, I., Faloutsos, C. On Packing R-trees. CIKM, 1993.
Kollios, G., Gunopulos, D., Tsotras, V., Dellis, A., Hadjieleftheriou, M. Indexing Animated Objects Using Spatiotemporal Access Methods. To appear in IEEE TKDE.
Kim, J., Kang, S., Kim, M. Effective Temporal Aggregation using Pointbased Trees. DEXA, 1999.
Kline, N., Snodgrass, R. Computing Temporal Aggregates. IEEE ICDE, 1995.
Kumar, A, Tsotras, V., Faloutsos, C. Design Access Methods for Bitemporal Databases. IEEE TKDE 10(1): 1–20, 1998.
Lazaridis, I., Mehrotra, S. Progressive Approximate Aggregate Queries with a Multi-Resolution Tree Structure. ACM SIGMOD, 2001.
Papadias, D., Kalnis, P., Zhang, J., Tao, Y. Efficient OLAP Operations in Spatial Data Warehouses. SSTD, 2001.
Pedersen, T., Tryfona, N. Pre-aggregation in Spatial Data Warehouses. SSTD, 2001.
Papadias, D., Tao, Y., Kalnis, P., Zhang, J. Indexing Spatio-temporal Data Warehouses. IEEE ICDE, 2002.
Salzberg, B., Tsotras, V. A Comparison of Access Methods for Temporal Data. ACM Computing Surveys, 31(2): 158–221, 1997.
Tao, Y., Papadias, D. The MV3R-tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries. VLDB, 2001.
Tao, Y., Papadias, D., Zhang, J. Efficient Cost Models for Overlapping and Multi-Version Structures. IEEE ICDE, 2002.
Theodoridis, Y., Sellis, T. A Model for the Prediction of R-tree Performance. ACM PODS, 1996.
Theodoridis, Y., Silva, J. Nascimento, M. On the Generation of Spatiotemporal Datasets. SSD, 1999.
Varman, P., Verma, R. An Efficient Multiversion Access Structure. IEEE TKDE, Vol. 9, No. 3, pp. 391–409, 1997.
Yao, A. Random 2-3 Trees. Acta Informatica, Vol. 2(9), 159–179, 1978.
Yang, J., Widom, J. Incremental Computation and Maintenance of Temporal Aggregates. IEEE ICDE, 2001.
Zhang, D., Markowetz, A., Tsotras, V., Gunopulos, D., Seeger, B. Efficient Computation of Temporal Aggregates with Range Predicates. ACM PODS, 2001.
Zhang, D., Tsotras, V., Seeger, B. Efficient Temporal Join Processing Using Indices. IEEE ICDE, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tao, Y., Papadias, D., Zhang, J. (2002). Aggregate Processing of Planar Points. In: Jensen, C.S., et al. Advances in Database Technology — EDBT 2002. EDBT 2002. Lecture Notes in Computer Science, vol 2287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45876-X_42
Download citation
DOI: https://doi.org/10.1007/3-540-45876-X_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43324-8
Online ISBN: 978-3-540-45876-0
eBook Packages: Springer Book Archive