Best point detour query in road networks

Shang, Shuo, Deng, Ke and Xie, Kexin (2010). Best point detour query in road networks. In: Pusheng Zhang, Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems (GIS '10). 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL GIS 2010), San Jose, CA, United States, (71-80). 3- 5 November 2010. doi:10.1145/1869790.1869804

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads
UQ233670_fulltext.pdf ERA evidence - not publicly available application/pdf 309.51KB 189

Author Shang, Shuo
Deng, Ke
Xie, Kexin
Title of paper Best point detour query in road networks
Conference name 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL GIS 2010)
Conference location San Jose, CA, United States
Conference dates 3- 5 November 2010
Proceedings title Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems (GIS '10)
Journal name GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems
Place of Publication New York, United States
Publisher ACM Press
Publication Year 2010
Sub-type Fully published paper
DOI 10.1145/1869790.1869804
Open Access Status File (Author Post-print)
ISBN 9781450304283
Editor Pusheng Zhang
Start page 71
End page 80
Total pages 10
Language eng
Formatted Abstract/Summary
A point detour is a temporary deviation from a user preferred path P (not necessarily a shortest network path) for visiting a data point such as a supermarket or McDonald's. The goodness of a point detour can be measured by the additional traveling introduced, called point detour cost or simply detour cost. Given a preferred path to be traveling on, Best Point Detour (BPD) query aims to identify the point detour with the minimum detour cost. This problem can be frequently found in our daily life but is less studied. In this work, the efficient processing of BPD query is investigated with support of devised optimization techniques. Furthermore, we investigate continuous-BPD query with target at the scenario where the path to be traveling on continuously changes when a user is moving to the destination along the preferred path. The challenge of continuous-BPD query lies in finding a set of update locations which split P into partitions. In the same partition, the user has the same BPD. We process continuous-BPD query by running BPD queries in a deliberately planned strategy. The efficiency study reveals that the number of BPD queries executed is optimal. The efficiency of BPD query and continuous-BPD query processing has been verified by extensive experiments.
Keyword Best point detour query
Road networks
Spatial databases
Q-Index Code E1
Q-Index Status Provisional Code
Institutional Status UQ

 
Versions
Version Filter Type
Citation counts: Scopus Citation Count Cited 7 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Wed, 09 Mar 2011, 13:03:06 EST by Dr Ke Deng on behalf of School of Information Technol and Elec Engineering