Skip to main content

Aggregation Query, Spatial

  • Reference work entry
Encyclopedia of GIS
  • 120 Accesses

Synonyms

Spatial aggregate computation

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...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

References

  1. Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R\( ^\ast \)-tree: An Efficient and Robust Access Method for Points and Rectangles. In: SIGMOD, pp. 322–331 (1990)

    Google Scholar 

  2. Bentley, J.L.: Multidimensional Divide-and-Conquer. Commun.s ACM 23(4), 214–229 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bentley, J.L., Saxe, N.B.: Decomposable Searching Problems I: Static-to-Dynamic Transformations. J. Algorithms 1(4), 301–358 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chiang, Y., Tamassia R.: Dynamic Algorithms in Computational Geometry. Proc. of the IEEE, Special Issue on Computational Geometry 80(9), 1412–1434 (1992)

    Google Scholar 

  5. Chung, C., Chun, S., Lee, J., Lee, S.: Dynamic Update Cube for Range-Sum Queries. In: VLDB, pp. 521–530 (2001)

    Google Scholar 

  6. Geffner, S., Agrawal, D., El Abbadi, A.: The Dynamic Data Cube. In: EDBT, pp: 237–253 (2000)

    Google Scholar 

  7. Lazaridis, I., Mehrotra, S.: Progressive Approximate Aggregate Queries with a Multi-Resolution Tree Structure. In: SIGMOD, pp. 401–412 (2001)

    Chapter  Google Scholar 

  8. Overmars, M.H.: The Design of Dynamic Data Structures. Lecture Notes in Computer Science, vol. 156, Springer, Heidelberg (1983)

    Google Scholar 

  9. Papadias, D., Kalnis, P., Zhang, J., Tao, Y.: Efficient OLAP Operations in Spatial Data Warehouses. In: Jensen, C.S.; Schneider, M.; Seeger, B.; Tsotras, V.J. (eds.) Advances in Spatial and Temporal Databases, 7th International Symposium, SSTD 2001, Redondo Beach, July 2001. Lecture Notes in Computer Science, vol. 2121, pp. 443–459. Springer, Heidelberg (2001)

    Google Scholar 

  10. Robinson, J.: The K-D-B Tree: A Search Structure For Large Multidimensional Dynamic Indexes. In: SIGMOD, pp 10–18 (1981)

    Google Scholar 

  11. Vitter, J.S.: External Memory Algorithms and Data Structures. ACM Comput. Surveys 33(2), 209–271 (2001)

    Article  Google Scholar 

  12. Zhang, D., Tsotras, V.J., Gunopulos, D.: Efficient Aggregation over Objects with Extent. In: PODS, pp. 121–132 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Zhang, D. (2008). Aggregation Query, Spatial. In: Shekhar, S., Xiong, H. (eds) Encyclopedia of GIS. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35973-1_43

Download citation

Publish with us

Policies and ethics