ACM Home Page
Please provide us with feedback. Feedback
Adaptive nearest neighbor queries in travel time networks
Full text PdfPdf (410 KB)
Source Geographic Information Systems archive
Proceedings of the 13th annual ACM international workshop on Geographic information systems table of contents
Bremen, Germany
SESSION: Query processing and optimization table of contents
Pages: 210 - 219  
Year of Publication: 2005
ISBN:1-59593-146-5
Authors
Wei-Shinn Ku  University of Southern California, Los Angeles, CA
Roger Zimmermann  University of Southern California, Los Angeles, CA
Haojun Wang  University of Southern California, Los Angeles, CA
Chi-Ngai Wan  University of Southern California, Los Angeles, CA
Sponsors
ACM: Association for Computing Machinery
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 16,   Downloads (12 Months): 103,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   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/1097064.1097094
What is a DOI?

ABSTRACT

Nearest neighbor (NN) searches represent an important class of queries in geographic information systems (GIS). Most nearest neighbor algorithms rely on static distance information to compute NN queries (e.g., Euclidean distance or spatial network distance). However, the final goal of a user when performing an NN search is often to travel to one of the points of the search result. In this case, finding the nearest neighbors in terms of travel time is more important than the actual distance. In the existing NN algorithms dynamic real-time events (e.g., traffic congestions, detours, etc.) are usually not considered and hence the pre-computed nearest neighbor objects may not accurately reflect the shortest travel time. In this paper we propose a novel travel time network that integrates both spatial networks and real-time traffic event information. Based on this foundation of the travel time network, we develop a local-based greedy nearest neighbor algorithm and a global-based adaptive nearest neighbor algorithm that both utilize real-time traffic information to provide adaptive nearest neighbor search results. We have performed a theoretical analysis and simulations to verify our methods. The results indicate that our algorithms remarkably reduce the travel time compared with previous nearest neighbor solutions.


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
2
 
3
Albert M.K. Cheng and Koushik Rajan. A Digital Map/GPS Based Routing and Addressing Scheme for Wireless Ad-hoc Networks. In Proceedings of the IEEE Intelligent Vehicle Symposium (IV'03), 2003.
 
4
Zhiming Ding and Ralf Hartmut Güting. Modeling temporally variable transportation networks. In Database Systems for Advances Applications, 9th International Conference, DASFAA 2004, Jeju Island, Korea, Proceedings, pages 154--168, 2004.
5
6
7
 
8
 
9
Mohammad R. Kolahdouzan and Cyrus Shahabi. Voronoi-based k nearest neighbor search for spatial network databases. In Proceedings of the Thirtieth International Conference on Very Large Data Bases, Toronto, Canada, pages 840--851, 2004.
 
10
Duke Lee, Roberto Attias, Anuj Puri, Raja Sengupta, Stavros Tripakis, and Pravin Varaiya. A wireless token ring protocol for intelligent transportation systems. In Proceedings of the 4th International IEEE Conference on Intelligent Transportation Systems, 2001.
 
11
Jun Luo and Jean-Pierre Hubaux. A Survey of Inter-Vehicle Communication. Technical Report IC/2004/24, School of Computer and Communication Sciences, EPFL, 2004.
 
12
Jörg Ott and Dirk Kutscher. Drive-thru internet: Ieee 802.11b for "automobile" users. In INFOCOM, 2004.
 
13
Dimitris Papadias, Jun Zhang, Nikos Mamoulis, and Yufei Tao. Query Processing in Spatial Network Databases. In Proceedings of the International Conference on Very Large Databases (VLDB), pages 790--801, 2003.
14
15
 
16
17
18
 
19
Jing Tian, Lu Han, and Kurt Rothermel. Spatially Aware Packet Routing for Mobile Ad Hoc Inter-Vehicle Radio Networks. In Proceedings of the IEEE Intelligent Transportation System Conference (ITSC'03), 2003.


Collaborative Colleagues:
Wei-Shinn Ku: colleagues
Roger Zimmermann: colleagues
Haojun Wang: colleagues
Chi-Ngai Wan: colleagues