Discovery of convoys in trajectory databases

Jeung, Hoyoung, Yiu, Man Lung, Zhou, Xiaofang, Jensen, Christian S. and Shen, Heng Tao (2008). Discovery of convoys in trajectory databases. In: Proceedings of the VLDB Endowment. VLDB '08: 34th International Conference on Very Large Data Bases, Auckland, New Zealand, (1068-1080). 23-28 August 2008. doi:10.1145/1453856.1453971

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads

Author Jeung, Hoyoung
Yiu, Man Lung
Zhou, Xiaofang
Jensen, Christian S.
Shen, Heng Tao
Title of paper Discovery of convoys in trajectory databases
Conference name VLDB '08: 34th International Conference on Very Large Data Bases
Conference location Auckland, New Zealand
Conference dates 23-28 August 2008
Convener D. Cerra
Proceedings title Proceedings of the VLDB Endowment   Check publisher's open access policy
Journal name Proceedings of the VLDB Endowment   Check publisher's open access policy
Place of Publication New York, United States
Publisher Association for Computing Machinery
Publication Year 2008
Sub-type Fully published paper
DOI 10.1145/1453856.1453971
ISSN 1047-7349
Volume 1
Issue 1
Start page 1068
End page 1080
Total pages 13
Collection year 2009
Language eng
Formatted Abstract/Summary
As mobile devices with positioning capabilities continue to proliferate, data management for so-called trajectory databases that capture the historical movements of populations of moving objects becomes important. This paper considers the querying of such databases for convoys, a convoy being a group of objects that have traveled together for some time.

More specifically, this paper formalizes the concept of a convoy query using density-based notions, in order to capture groups of arbitrary extents and shapes. Convoy discovery is relevant for real-life applications in throughput planning of trucks and carpooling of vehicles. Although there has been extensive research on trajectories in the literature, none of this can be applied to retrieve correctly exact convoy result sets. Motivated by this, we develop three efficient algorithms for convoy discovery that adopt the well-known filter-refinement framework. In the filter step, we apply line-simplification techniques on the trajectories and establish distance bounds between the simplified trajectories. This permits efficient convoy discovery over the simplified trajectories without missing any actual convoys. In the refinement step, the candidate convoys are further processed to obtain the actual convoys. Our comprehensive empirical study offers insight into the properties of the paper's proposals and demonstrates that the proposals are effective and efficient on real-world trajectory data.
Subjects E1
890205 Information Processing Services (incl. Data Entry and Capture)
080604 Database Management
Q-Index Code E1
Q-Index Status Confirmed Code
Institutional Status UQ

Version Filter Type
Citation counts: Scopus Citation Count Cited 0 times in Scopus Article
Google Scholar Search Google Scholar
Created: Fri, 17 Apr 2009, 12:03:30 EST by Ms Kimberley Nunes on behalf of School of Information Technol and Elec Engineering