Synonyms
Definition
Given a set O of weighted point objects and a rectangular query region r in the d-dimensional space, the spatial aggregation query asks the total weight of all objects in O which are contained in r.
This query corresponds to the SUM aggregation. The COUNT aggregation, which asks for the number of objects in the query region, is a special case when every object has equal weight.
The problem can actually be reduced to a special case, called the dominance-sum query. An object o 1 dominates another object o 2 if o 1 has larger value in all dimensions. The dominance-sum query asks for the total weight of objects dominated by a given point p. It is a special case of the spatial aggregation query, when the query region is described by two extreme points: the lower-left corner of space and p.
The spatial aggregation query can be reduced to the dominance-sum query in the 2D space, as illustrated below. Given a query region r(a 2D rectangle),...
This is a preview of subscription content, log in via an institution to check access.
References
Beckmann N, Kriegel HP, Schneider R, Seeger B (1990) The R∗-tree: an efficient and robust access method for points and rectangles. In: SIGMOD, Atlantic City, pp 322–331
Bentley JL (1980) Multidimensional divide-and-conquer. Commun ACM 23(4):214–229
Bentley JL, Saxe NB (1980) Decomposable searching problems I: static-to-dynamic transformations. J Algorithms 1(4):301–358
Chiang Y, Tamassia R (1992) Dynamic algorithms in computational geometry. Proc IEEE Spec Issue Comput Geom 80(9):1412–1434
Chung C, Chun S, Lee J, Lee S (2001) Dynamic update cube for range-sum queries. In: VLDB, Roma, pp 521–530
Geffner S, Agrawal D, El Abbadi A (2000) The dynamic data cube. In: EDBT, Konstanz, pp 237–253
Lazaridis I, Mehrotra S (2001) Progressive approximate aggregate queries with a multi-resolution tree structure. In: SIGMOD, Santa Barbara, pp 401–412
Overmars MH (1983) The design of dynamic data structures. Lecture notes in computer science, vol 156. Springer, Heidelberg
Papadias D, Kalnis P, Zhang J, Tao Y (2001) Efficient OLAP operations in spatial data warehouses. In: Jensen CS, Schneider M, Seeger B, Tsotras VJ (eds) Advances in spatial and temporal databases, 7th international symposium, SSTD 2001, Redondo Beach, July 2001. Lecture notes in computer science, vol 2121. Springer, Heidelberg, pp 443–459
Robinson J (1981) The K-D-B tree: a search structure for large multidimensional dynamic indexes. In: SIGMOD, Orlando, pp 10–18
Vitter JS (2001) External memory algorithms and data structures. ACM Comput Surv 33(2):209–271
Zhang D, Tsotras VJ, Gunopulos D (2002) Efficient aggregation over objects with extent. In: PODS, Madison, pp 121–132
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this entry
Cite this entry
Zhang, D. (2016). Aggregation Query, Spatial. In: Shekhar, S., Xiong, H., Zhou, X. (eds) Encyclopedia of GIS. Springer, Cham. https://doi.org/10.1007/978-3-319-23519-6_43-2
Download citation
DOI: https://doi.org/10.1007/978-3-319-23519-6_43-2
Received:
Accepted:
Published:
Publisher Name: Springer, Cham
Online ISBN: 978-3-319-23519-6
eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering