Encyclopedia of GIS

2017 Edition
| Editors: Shashi Shekhar, Hui Xiong, Xun Zhou

MaxCount Spatiotemporal Aggregate Operator

  • Scot AndersonEmail author
Reference work entry
DOI: https://doi.org/10.1007/978-3-319-17885-1_1597



Spatiotemporal aggregation operators answer summary questions about spatiotemporal data maintained in spatiotemporal databases. Aggregation over the two distinctly different domains of time and space requires unique index structures and algorithms. MaxCount finds the largest number of objects intersecting a dynamic query space and the time at which this maximum occurs. Formally we define MaxCount as follows: Let S be a set of moving objects. Given a dynamic query space R defined by two moving points Q1 and Q2 as the lower-left and upper-right corners of R, and a time interval T, the MaxCount operator finds the time tmax and maximum number of points Mmax in S that R can contain at any time instance within T. Dynamic query space is defined by a continuous time interval T, and a d-dimensional space that can move, and change size or shape over the query time interval (Anderson and Revesz 2009). In the index a dual...

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


  1. Anderson S (2006) Aggregation estimation for 2D moving points. In: Thirteenth international symposium on temporal representation and reasoning, Piscataway. IEEE Computer Society Press, pp 137–144CrossRefGoogle Scholar
  2. Anderson S (2007) Software verification and spatiotemporal aggregation in constraint databases. PhD thesis, University of Nebraska, LincolnGoogle Scholar
  3. Anderson S, Revesz P (2009) Efficient maxcount and threshold operators of moving objects. Geoinformatica 13(4):355–396CrossRefGoogle Scholar
  4. Chen Y, Revesz P (2004) Max-count aggregation estimation for moving points. In: Proceedings of the 11th international symposium on temporal representation and reasoning, Tatihou, pp 103–108Google Scholar
  5. Kollios G, Papadopoulos D, Gunopulos D, Tsotras J (2005) Indexing mobile objects using dual transformations. VLDB J 14(2):238–256CrossRefGoogle Scholar
  6. Revesz P, Chen Y (2003) Efficient aggregation over moving objects. In: Proceedings of the 10th international symposium on temporal representation and reasoning, fourth international conference on temporal logic, Cairns, pp 118–127Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Southern Adventist UniversityCollegedaleUSA