Hierarchical graph embedding for efficient query processing in very large traffic networks

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

Volumn 5069 LNCS, Issue , 2008, Pages 150-167

  Kriegel, Hans Peter ^a   Kröger, Peer ^a   Renz, Matthias ^a   Schmidt, Tim ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; DATA PROCESSING; DATA STORAGE EQUIPMENT; DATABASE SYSTEMS; GRAPH THEORY; MANAGEMENT INFORMATION SYSTEMS; STATISTICAL METHODS;

DATABASE MANAGEMENT; DYNAMIC OBJECTS; EXPERIMENTAL EVALUATIONS; GRAPH EMBEDDING; HIERARCHICAL GRAPHS; INTERNATIONAL CONFERENCES; K-NEAREST NEIGHBOR QUERIES; NOVEL CONCEPT; REAL-WORLD DATA SETS; REFERENCE NODES; SHORTEST PATH DISTANCE; SPEED UPS; TRAFFIC NETWORKS; VERY LARGE NETWORKS;

QUERY PROCESSING;

EID: 49049101133     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69497-7_12     Document Type: Conference Paper

References (18)

1. Dijkstra, E.W.: A Note on Two Problems in Connection with Graphs. Numerische Mathematik 1, 269-271 (1959)
2. Corman, T.H., Leiserson, C.E., Riverst, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)
3. Kung, R., Hanson, E., Ioannidis, Y., Sellis, T., Shapiro, L., Stonebraker, M.: Heuristic Search in Data Base Systems. Expert Database Systems (1986)
4. Agrawal, R., Dar, S., Jagadish, H.: Direct Transitive Closure Algorithms: Design and Performance Evaluation. TODS 15(3) (1990)
5. Ioannidis, Y., Ramakrishnan, R., Winger, L.: Transitive Closure Algorithms Based on Graph Traversal. TODS 18(3) (1993)
6. Jung, S., Pramanik, S.: HiTi Graph Model of Topographical Roadmaps in Navigation Systems. In: Proc. Int. Conf. on Data Engineering (ICDE 1996) (1996)
7. Köhler, E., Möhring, R.H., Schilling, H.: Acceleration of Shortest Path and Constrained Shortest Path Computation. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 126-138. Springer, Heidelberg (2005)
8. Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query Processing in Spatial Network Databases. In: Proc. Int. Conf. on Very Large Databases (VLDB 2003) (2003)
9. Shahabi, C., Kolahdouzan, M., Sharifzadeh, M.: A Road Network Embedding Technique for k-Nearest Neighbor Search in Moving Object Databases. Geoinformatica 7(3), 255-273 (2003)
10. Linial, N., London, E., Rabinovich, Y.: The geometry of graphs and some of its algorithmic applications. In: Proc. IEEE Symp. Foundations of Computer Science (1994)
11. Hu, H., Lee, D.L., Lee, V.C.S.: Distance Indexing on Road Networks. In: Proc. Int. Conf. on Very Large Databases (VLDB 2006) (2006)
12. Goldberg, A.V., Werneck, R.F.: Computing Point-to-Point Shortest Paths from External Memory. In: Proc. of the 7th WS on Algorithm Engineering and Experiments (ALENEX). SIAM, Philadelphia (2005)
13. Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for A*: Efficient point-to-point shortest path algorithms'. In: Proc. of the 8th WS on Algorithm Engineering and Experiments (ALENEX). SIAM, Philadelphia (2006)
14. Kriegel, H.P., Kröger, P., Kunath, P., Renz, M., Schmidt, T.: Proximity Queries in Large Traffic Networks. In: Proc. 15th Int. Symposium on Advances in Geographic Information Systeme (ACM GIS 2007), Seattle, WA (2007)
15. Kolahdouzan, M., Shahabi, C.: Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases. In: Proc. Int. Conf. on Very Large Databases (VLDB 2004) (2004)
16. Kolahdouzan, M., Shahabi, C.: Continuous K-Nearest Neighbor Queries in Spatial Network Databases. In: Proc. of STDBM 2004 (2004)
17. Cho, H.J., Chung, C.W.: An efficient and scalable approach to cnn queries in a road network. In: Proc. Int. Conf. on Very Large Databases (VLDB 2005) (2005)
18. Kriegel, H.P., Kröger, P., Kunath, P., Renz, M.: Generalizing the Optimality of Multi-Step k-Nearest Neighbor Query Processing. In: Papadias, D., Zhang, D., Kollios, G. (eds.) SSTD 2007. LNCS, vol. 4605, pp. 75-92. Springer, Heidelberg (2007)