Towards K-nearest neighbor search in time-dependent spatial network databases

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5999 LNCS, Issue , 2010, Pages 296-310

  Demiryurek, Ugur ^a   Banaei Kashani, Farnoush ^a   Shahabi, Cyrus ^a  

^a University of Southern California ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EDGE WEIGHTS; EXPERIMENTAL EVALUATION; K NEAREST NEIGHBOR SEARCH; K-NEAREST NEIGHBORS; K-NN SEARCH; REAL TRAFFIC; REAL WORLD DATA; REAL-WORLD; SHORT DURATIONS; SPATIAL NETWORK; SPATIAL NETWORK DATABASE; TIME VARIABLE; TIME-DEPENDENT;

INFORMATION SYSTEMS; MOTION COMPENSATION; TECHNICAL PRESENTATIONS;

DATABASE SYSTEMS;

EID: 77951567673     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12038-1_20     Document Type: Conference Paper

References (24)

1. Chabini, I.: The discrete-time dynamic shortest path problem: Complexity, algorithms, and implementations. In: Transportation Research Record (1999)
2. Cho, H.-J., Chung, C.-W.: An efficient and scalable approach to cnn queries in a road network. In: VLDB (2005)
3. Cooke, L., Halsey, E.: The shortest route through a network with timedependent internodal transit times. Journal of Mathematical Analysis and Applications (1966)
4. Dean, B.C.: Algorithms for minimum cost paths in time-dependent networks. Networks (1999)
5. Demiryurek, U., Banaei-Kashani, F., Shahabi, C.: Efficient continuous nearest neighbor query in spatial networks using euclidean restriction. In: Mamoulis, N., Seidl, T., Pedersen, T.B., Torp, K., Assent, I. (eds.) Advances in Spatial and Temporal Databases. LNCS, vol.5644, pp. 25-43. Springer, Heidelberg (2009)
6. Demiryurek, U., Pan, B., Kashani, F.B., Shahabi, C.: Towards modeling the traffic data on road networks. In: GIS-IWCTS (2009)
7. Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: EDBT (2008)
8. Dreyfus, S.E.: An appraisal of some shortest-path algorithms. Operations Research 17(3) (1969)
9. George, B., Kim, S., Shekhar, S.: Spatio-temporal network databases and routing algorithms: A summary of results. In: Papadias, D., Zhang, D., Kollios, G. (eds.) SSTD 2007. LNCS, vol.4605, pp. 460-477. Springer, Heidelberg (2007)
10. Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: SIGMOD (1984)
11. Halpern, J.: Shortest route with time dependent length of edges and limited delay possibilities in nodes. In: Mathematical Methods of Operations Research (1969)
12. Huang, X., Jensen, C.S., Saltenis, S.: The island approach to nearest neighbor querying in spatial networks. In: Bauzer Medeiros, C., Egenhofer, M.J., Bertino, E. (eds.) SSTD 2005. LNCS, vol.3633, pp. 73-90. Springer, Heidelberg (2005)
13. Huang, X., Jensen, C.S., Saltenis, S.: S-grid: A versatile approach to efficient query processing in spatial networks. In: Papadias, D., Zhang, D., Kollios, G. (eds.) SSTD 2007. LNCS, vol.4605, pp. 93-111. Springer, Heidelberg (2007)
14. Inrix, http://www.inrix.com (last visited January 2, 2010)
15. Kanoulas, E., Du, Y., Xia, T., Zhang, D.: Finding fastest paths on a road network with speed patterns. In: ICDE (2006)
16. Kolahdouzan, M., Shahabi, C.: Voronoi-based k nearest neighbor search for spatial network databases. In: VLDB (2004)
17. Lauther, U.: An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background. In: Geoinformation and Mobilitat (2004)
18. Mouratidis, K., Yiu, M.L., Papadias, D., Mamoulis, N.: Continuous nearest neighbor monitoring in road networks. In: VLDB (2006)
19. Navteq, http://www.navteq.com (last visited January 2, 2010)
20. Orda, A., Rom, R.: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. J. ACM (1990)
21. Pallottino, S., Scutellà, M.G.: Shortest path algorithms in transportation models: Classical and innovative aspects. In: Equilibrium and Advanced Transportation Modelling (1998)
22. Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: VLDB (2003)
23. Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing in spatial databases. In: SIGMOD (2008)
24. Wagner, D., Willhalm, T.: Geometric speed-up techniques for finding shortest paths in large sparse graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.2832, pp. 776-787. Springer, Heidelberg (2003)