DocumentCode
3324742
Title
Convoy Queries in Spatio-Temporal Databases
Author
Jeung, Hoyoung ; Shen, Heng Tao ; Zhou, Xiaofang
Author_Institution
Nat. ICT Australia, Univ. of Queensland, Brisbane, QLD
fYear
2008
fDate
7-12 April 2008
Firstpage
1457
Lastpage
1459
Abstract
We introduce a convoy query that retrieves all convoys from historical trajectories, each of which consists of a set of objects that travelled closely during a certain time period. Convoy query is useful for many applications such as carpooling and traffic jam analysis, however, limited work has been done in the database community. This study proposes three efficient methods for discovering convoys. The main novelty of our methods is to approximate original trajectories by using line simplification methods and perform the discovery process over the simplified trajectories with bounded errors. Our experimental results confirm the effectiveness and efficiency of our methods.
Keywords
query processing; temporal databases; visual databases; convoy query; line simplification method; spatio-temporal databases; Clustering algorithms; Costs; Databases; Euclidean distance; Fuels; Throughput; Trajectory;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Engineering, 2008. ICDE 2008. IEEE 24th International Conference on
Conference_Location
Cancun
Print_ISBN
978-1-4244-1836-7
Electronic_ISBN
978-1-4244-1837-4
Type
conf
DOI
10.1109/ICDE.2008.4497588
Filename
4497588
Link To Document