MaxCount Spatiotemporal Aggregate Operator
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...
- Anderson S (2007) Software verification and spatiotemporal aggregation in constraint databases. PhD thesis, University of Nebraska, LincolnGoogle Scholar
- 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
- 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