On-line exact shortest distance query processing

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, EDBT'09

Volumn , Issue , 2009, Pages 481-492

  Cheng, Jiefeng ^a   Yu, Jeffrey Xu ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; ENCODING (SYMBOLS); QUERY PROCESSING;

ALL PAIRS SHORTEST PATHS; COMPUTING DISTANCES; DISTANCE INFORMATION; GRAPH PARTITIONING; REACHABILITY QUERIES; SHORTEST PATH QUERIES; STRONGLY CONNECTED COMPONENT; VERY LARGE DATABASE;

GRAPH THEORY;

EID: 70349122425     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1516360.1516417     Document Type: Conference Paper

References (42)

1. R. Agrawal, A. Borgida, and H. V. Jagadish. Efficient management of transitive relationships in large data and knowledge bases. In Proc. of SIGMOD'89, 1989.
2. R. Agrawal and H. V. Jagadish. Algorithms for searching massive graphs. IEEE Trans. on Knowl. and Data Eng., 06(2), 1994.
3. L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan. Group formation in large social networks: membership, growth, and evolution. In Proc. of KDD '06, 2006.
4. R. Bellman. On a routing problem. Quarterly of Applied Mathematics, 16(l):87-90, 1958.
5. R. Bramandia, B. Choi, and W. K. Ng. On incremental maintenance of 2-hop labeling of graphs. In Proc. of WWW '08, 2008.
6. L. Chen, A. Gupta, and M. E. Kurul. Stack-based algorithms for pattern matching on dags. In Proc. of VLDB'05, 2005.
7. J. Cheng, J. X. Yu, X. Lin, H. Wang, and P. S. Yu. Fast computation of reachability labeling for large graphs. In Proc. of EDBT'06, 2006.
8. J. Cheng, J. X. Yu, X. Lin, H. Wang, and P. S. Yu. Fast computing reachability labelings for large graphs with high compression rate. In Proc. of EDBT '08, 2008.
9. E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. In Proc. of SODA'02, 2002.
10. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to algorithms. MIT Press, 2001.
11. F. Dabek, R. Cox, F. Kaashoek, and R. Morris. Predicting internet network distance with coordinates-based approaches. In Proc. of SIGGOMM '04, 2004.
12. E. W. Dijkstra. A note on two problems in connection with graphs. Numerische Math., 1:269-271, 1959.
13. R. W. Floyd. Shortest path. Communications of the ACM, 5:345, 1962.
14. C. Gavoille, D. Peleg, S. Pérennes, and R. Raz. Distance labeling in graphs. J. Algorithms, 53(1):85-112, 2004.
15. A. V. Goldberg and R. F. Werneck. Computing point-to-point shortest paths from external memory. In Proc. of ALENEX '05, 2005.
16. *: Efficient point-to-point shortest path algorithms. In Proc. of ALENEX '06, 2006.
17. G. Gou and R. Chirkova. Efficient algorithms for exact ranked twig-pattern matching over graphs. In Proc. of SIGMOD '08, 2008.
18. H. He, H. Wang, J. Yang, and P. S. Yu. Blinks: ranked keyword searches on graphs. In Proc. of SIGMOD '07, 2007.
19. H. V. Jagadish. A compression technique to materialize transitive closure. ACM Trans. Database Syst., 15(4):558-598, 1990.
20. R. Jin, Y. Xiang, N. Ruan, and H. Wang. Efficiently answering reachability queries on very large directed graphs. In Proc. of SIGMOD '08, 2008.
21. N. Jing, Y.-W. Huang, and E. A. Rundensteiner. Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation. IEEE Trans. on Knowl. and Data Eng., 10(3), 1998.
22. D. B. Johnson. Finding all the elementary circuits of a directed graph. SIAM J. Comput., 4(l):77-84, 1975.
23. D. S. Johnson. Approximation algorithms for combinatorial problems. In Proc. of STOC'73, 1973.
24. R. Johnsonbaugh and M. Kalin. A graph generation software package. In Prof. of SIGGSE'91, 1991.
25. S. Jung and S. Pramanik. An efficient path computation model for hierarchically structured topographical road maps. IEEE Trans. on Knowl. and Data Eng., 14(5), 2002.
26. D. Kempe, J. Kleinberg, and Éva Tardos. Maximizing the spread of influence through a social network. In Proc. of KDD '03, 2003.
27. I. M. Keseler, J. Collado-Vides, S. Gama-Castro, J. Ingraham, S. Paley, I. T. Paulsen, M. Peralta-Gil, and P. D. Karp. Ecocyc: a comprehensive database resource for escherichia coli. Nucleic Acids Research, 33(D334-7), 2005.
28. D. E. Knuth. The Stanford GraphBase: a platform for combinatorial computing. ACM Press, 1993.
29. T. S. E. Ng and H. Zhang. Predicting internet network distance with coordiantes-based approaches. In Proc. of INFOGOM '01, 2001.
30. D. Peleg. Proximity-preserving labeling schemes. J. Graph Theory, 33:167-176, 2000.
31. S. Pettie. On the shortest path and minimum spanning tree problems. PH.D Dissertation, The University of Texas at Austin, 2003.
32. S. A. Rahman, P. Advani, R. Schunk, R. Schrader, and D. Schomburg. Metabolic pathway analysis web service (Pathway Hunter Tool at CUBIC). Bioinformatics, 21(7):1189-1193.
33. R. Schenkel, A. Theobald, and G. Weikum. Hopi: An efficient connection index for complex XML document collections. In Proc. of EDBT'04 2004.
34. R. Schenkel, A. Theobald, and G. Weikum. Efficient creation and incremental maintenance of the HOPI index for complex XML document collections. In Proc. of ICDE'05, 2005.
35. A. Schmidt, F. Waas, M. Kersten, M. J. Carey, I. Manolescu, and R. Busse. Xmark: A benchmark for xml data management. In Proc. of VLDB'02, 2002.
36. R. E. Tarjan. Enumeration of the elementary circuits of a directed graph. SIAM J. Gomput., 2(3):211-216, 1973.
37. M. Thorup and U. Zwick. Approximate distance oracles. In Proc. of STOG '01, 2001.
38. S. TrişI and U. Leser. Fast and practical indexing and querying of very large graphs. In Proc. of SIGMOD '07, 2007.
39. H. Wang, H. He, J. Yang, P. S. Yu, and J. X. Yu. Dual labeling: Answering graph reachability queries in constant time. In Proc. of ICDE'06, 2006.
40. S. Wasserman and K. Faust. Social Network Analysis. Cambridge University Press, 1994.
41. R. Yuster and U. Zwick. Answering distance queries in directed graphs using fast matrix multiplication. In Proc. of FOGS '05, 2005.
42. U. Zwick. All pairs shortest paths using bridging sets and rectangular matrix multiplication. J. ACM, 49(3):289-317, 2002.