Relational approach for shortest path discovery over large graphs

Proceedings of the VLDB Endowment

Volumn 5, Issue 4, 2011, Pages 358-369

  Gao, Jun ^a   Jin, Ruoming ^b   Zhou, Jiashuai ^a   Yu, Jeffrey Xu ^c   Jiang, Xiao ^a   Wang, Tengjiao ^a  

^a Peking University   (China)

^b KENT STATE UNIVERSITY   (United States)

^c CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION MANAGEMENT; ITERATIVE METHODS; OPTIMIZATION;

DIJKSTRA'S ALGORITHMS; GRAPH OPERATIONS; HIGH SCALABILITIES; ITERATIVE OPERATION; OPTIMIZATION STRATEGY; RELATIONAL DATABASES (RDB); SHORTEST SEGMENT; WINDOW FUNCTIONS;

GRAPH THEORY;

EID: 84863741568     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/2095686.2095694     Document Type: Article

References (25)

1. Apache Hadoop. http://hadoop.apache.org.
2. A. Goldberg and C. Harrelson. Computing the shortest path: search meets graph theory. In SODA, pages 156-165, 2005.
3. B. Bahmani, K. Chakrabarti, and D.Xin. Fast personalized pagerank on mapreduce. In SIGMOD, pages 973-984, 2011.
4. B.Zou, X.Ma, B.Kemme, G.Newton, and D.Precup. Data mining using relational database management systems. In PAKDD, pages 657-667, 2006.
5. C.Aggarwal, Y.Xie, and P.Yu. Gconnect: A connectivity index for massive disk-resident graphs. PVLDB, 2(1):862-873, 2009.
6. C.Mayfield, J.Neville, and S.Prabhakar. Eracer: a database approach for statistical inference and data cleaning. In SIGMOD, pages 75-86, 2010.
7. C.Wang, W.Wang, J.Pei, Y.Zhu, and B.Shi. Scalable mining of large disk-based graph databases. In SIGKDD, pages 316-325, 2004.
8. D. Hutchinson, A. Maheshwari, and N.Zeh. An external memory data structure for shortest path queries. Discrete Applied Mathematics, 126(1):55-82, 2003.
9. D. Johnson and L. McGeoch. The traveling salesman problem: A case study in local optimization. Local search in combinatorial optimization, 215-310, 1997.
10. D. Wagner and T. Willhalm. Speed-up techniques for shortest-path computations. In STACS, pages 23-36, 2007.
11. E.Cohen, E.Halperin, H.Kaplan, and U.Zwick. Reachability and distance queries via 2-hop labels. In SODA, pages 937-946, 2002.
12. E.Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, pages 269-271, 1959.
13. F.Tian, B.Reinwald, H.Pirahesh, T.Mayr, and J.Myllymaki. Implementing a scalable xml publish/subscribe system using a relational database system. In SIGMOD, pages 479-490, 2004.
14. H.Garcia-Molina, J.Ullman, and J.Widom. Database Systems: The Complete Book. Prentice Hall Press, 2008.
15. J.Cheng, Y.Ke, A.W.Fu, J.X.Yu, and L.Zhu. Finding maximal cliques in massive networks by h*-graph. In SIGMOD, pages 447-458, 2010.
16. J. Dean and S. Ghemawat. Mapreduce: Simplified data processing on large clusters. In OSDI, pages 137-150, 2004.
17. J.Shanmugasundaram, K.Tufte, C.Zhang, G.He, D.DeWitt, and J.Naughton. Relational databases for querying xml documents: Limitations and opportunities. In VLDB, pages 302-314, 1999.
18. M.Benedikt, C.Chan, W.Fan, R.Rastogi, S.Zheng, and A.Zhou. Dtd-directed publishing with attribute translation grammars. In VLDB, pages 838-849, 2002.
19. M.Potamias, F.Bonchi, C.Castillo, and A.Gionis. Fast shortest path distance estimation in large networks. In CIKM, pages 453-470, 2009.
20. R.Prim. Shortest connection networks and some generalizations. Bell System Technical Journal, 36:1389-1401, 1957.
21. R. Ronen and O. Shmueli. Soql: A language for querying and creating data in social networks. In ICDE, pages 1595-1602, 2009.
22. S.Srihari, S.Chandrashekar, and S.Parthasarathy. A framework for sql-based mining of large graphs on relational databases. In PAKDD, pages 160-167, 2010.
23. S.Trißl and U.Leser. Fast and practical indexing and querying of very large graphs. In SIGMOD, pages 845-856, 2007.
24. F. Wei. Tedi: efficient shortest path query answering on graphs. In SIGMOD, pages 99-110, 2010.
25. W.Fan, J.Li, S.Ma, N.Tang, Y.Wu, and Y.Wu. Graph pattern matching: From intractable to polynomial time. PVLDB, 3(1):264-275, 2010.