ACM Home Page
Please provide us with feedback. Feedback
Sequenced spatio-temporal aggregation in road networks
Full text PdfPdf (901 KB)
Source Extending Database Technology; Vol. 360 archive
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology table of contents
Saint Petersburg, Russia
SESSION: Research sessions: Spatio-temporal table of contents
Pages 48-59  
Year of Publication: 2009
ISBN:978-1-60558-422-5
Authors
Igor Timko  Free University of Bozen-Bolzano, Italy
Michael H. Böhlen  Free University of Bozen-Bolzano, Italy
Johann Gamper  Free University of Bozen-Bolzano, Italy
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 24,   Downloads (12 Months): 93,   Citation Count: 0
Additional Information:

abstract   references   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1516360.1516368
What is a DOI?

ABSTRACT

Many applications of spatio-temporal databases require support for sequenced spatio-temporal (SST) aggregation, e. g., when analyzing traffic density in a city. Conceptually, an SST aggregation produces one aggregate value for each point in time and space.

This paper is the first to propose a method to efficiently evaluate SST aggregation queries for the COUNT, SUM, and AVG aggregation functions. Based on a discrete time model and a discrete, 1.5 dimensional space model that represents a road network, we generalize the concept of (temporal) constant intervals towards constant rectangles that represent maximal rectangles in the space-time domain over which the aggregation result is constant. We propose a new data structure, termed SST-tree, which extends the Balanced Tree for one-dimensional temporal aggregation towards the support for two-dimensional, spatio-temporal aggregation. The main feature of the Balanced Tree to store constant intervals in a compact way by using two counters is extended towards a compact representation of constant rectangles in the space-time domain. We propose and evaluate two variants of the SST-tree. The SSTT-tree and SSTH-tree use trees and hashmaps to manage spacestamps, respectively. Our experiments show that both solutions outperform a brute force approach in terms of memory and time. The SSTH-tree is more efficient in terms of memory, whereas the SSTT-tree is more efficient in terms of time.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
R. Bayer. Binary b-trees for virtual memory. In ACM SIGFIDET, pages 219--235, 1971.
 
2
 
3
M. H. Böhlen, J. Gamper, and C. S. Jensen. Multi-dimensional aggregation for temporal data. In EDBT, pages 257--275, 2006.
 
4
 
5
 
6
 
7
Google. Google's sparsehash project. http://code.google.com/p/google-sparsehash/. Current as of December 12, 2008.
 
8
9
 
10
11
 
12
C. S. Jensen, K.-J. Lee, S. Pakalnis, and S. Šaltenis. Advanced tracking of vehicles. In European Congress and Exhibition on ITS, page 12 pages, 2005.
 
13
 
14
R. Kothuri, A. Godfrind, and E. Beinat. Pro Oracle Spatial. Apress, 2004.
 
15
J. A. C. Lema, L. Forlizzi, R. H. Güting, E. Nardelli, and M. Schneider. Algorithms for moving objects databases. Comput. J., 46(6):680--712, 2003.
 
16
 
17
 
18
NCHRP. A Generic Data Model for Linear Referencing Systems. Transportation Research Board, Washington, DC, USA, 1997.
 
19
 
20
 
21
 
22
 
23
 
24
 
25
 
26
 
27
 
28
29
Collaborative Colleagues:
Igor Timko: colleagues
Michael H. Böhlen: colleagues
Johann Gamper: colleagues