Efficient processing of k-hop reachability queries

VLDB Journal

Volumn 23, Issue 2, 2014, Pages 227-252

  Cheng, James ^a   Shang, Zechao ^a   Cheng, Hong ^a   Wang, Haixun ^b   Yu, Jeffrey Xu ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b MICROSOFT RESEARCH ASIA   (China)

Author keywords

Distance queries; Graph indexing; k hop reachability; Reachability index; Shortest path index

Indexed keywords

DIRECTED GRAPHS;

DISTANCE QUERIES; GRAPH INDEXING; REACHABILITY; REACHABILITY INDEX; SHORTEST PATH;

XML;

EID: 84897570535     PISSN: 10668888     EISSN: 0949877X     Source Type: Journal    
DOI: 10.1007/s00778-013-0346-6     Document Type: Article

References (38)

1. Abraham, I., Fiat, A., Goldberg, A.V., Werneck, R.F.F.: Highway dimension, shortest paths, and provably efficient algorithms. In SODA, pp. 782-793 (2010)
2. Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases. In SIGMOD Conference, pp. 253-262 (1989)
3. Akiba, T., Iwata, Y., Yoshida, Y.: Fast exact shortest-path distance queries on large networks by pruned landmark labeling. To appear in SIGMOD Conference (2013)
4. Boldi, P., Rosa, M., Vigna, S.: Hyperanf: approximating the neighbourhood function of very large graphs on a budget. InWWW, pp. 625-634 (2011)
5. Bramandia, R., Choi, B., Ng, W.K.: On incremental maintenance of 2-hop labeling of graphs. In WWW, pp. 845-854 (2008)
6. Chen, L., Gupta, A., Kurul, M.E.: Stack-based algorithms for pattern matching on DAGs. In VLDB, pp. 493-504 (2005)
7. Chen, Y., Chen, Y.: An efficient algorithm for answering graph reachability queries. In ICDE, pp. 893-902 (2008)
8. Chen, Y., Chen, Y.: Decomposing DAGs into spanning trees: A new way to compress transitive closures. In ICDE, pp. 1007-1018 (2011)
9. Cheng, J., Ke, Y., Chu, S., Cheng, C.: Efficient processing of distance queries in large graphs:Avertex cover approach. In SIGMOD Conference, pp. 457-468 (2012)
10. Cheng, J., Ke, Y., Fu, A.W.-C., Yu, J.X., Zhu, L.: Finding maximal cliques inmassive networks by h*-graph. In SIGMOD Conference, pp. 447-458 (2010)
11. Cheng, J., Shang, Z., Cheng, H., Wang, H., Yu, J.X.: K-reach:Who is in your small world. PVLDB 5(11), 1292-1303 (2012)
12. Cheng, J., Yu, J.X.: On-line exact shortest distance query processing. In EDBT, pp. 481-492 (2009)
13. Cheng, J., Yu, J.X., Lin, X., Wang, H., Yu, P.S.: Fast computation of reachability labeling for large graphs. In EDBT, pp. 961-979 (2006)
14. Cheng, J., Yu, J.X., Lin, X., Wang, H., Yu, P.S.: Fast computing reachability labelings for large graphs with high compression rate. In EDBT, pp. 193-204 (2008)
15. Cheng, J., Yu, J.X., Tang, N.: Fast reachability query processing. In DASFAA, pp. 674-688 (2006)
16. Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. In SODA, pp. 937-946 (2002)
17. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge, MA (2009)
18. Dorogovtsev, S.N., Mendes, J.F.F., Samukhin, A.N.: Structure of growing networkswith preferential linking. Phys. Rev. Lett. 85(21), 4633-4636 (2000)
19. Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the internet topology. In SIGCOMM, pp. 251-262 (1999)
20. Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634-652 (1998)
21. Hochbaum, D.S.: Approximation Algorithms for NP-hard Problems. PWS Publishing Co., Boston, MA, USA (1997)
22. Jagadish, H.V.: A compression technique to materialize transitive closure. ACM Trans. Database Syst. 15(4), 558-598 (1990)
23. Jin, R., Hong, H., Wang, H., Ruan, N., Xiang, Y.: Computing labelconstraint reachability in graph databases. In SIGMOD Conference, pp. 123-134 (2010)
24. Jin, R., Liu, L., Ding, B., Wang, H.: Distance-constraint reachability computation in uncertain graphs. PVLDB 4(9), 551-562 (2011)
25. Jin, R., Ruan, N., Xiang, Y., Lee, V.E.: A highway-centric labeling approach for answering distance queries on large sparse graphs. In SIGMOD Conference, pp. 445-456 (2012)
26. Jin, R., Ruan, N., Xiang, Y., Wang, H.: Path-tree: Anefficient reachability indexing scheme for large directed graphs. ACM Trans. Database Syst. 36(1), 7 (2011)
27. Jin, R., Xiang, Y., Ruan, N., Fuhry, D.: 3-hop: a high-compression indexing scheme for reachability query. In SIGMOD Conference, pp. 813-826 (2009)
28. Jin, R., Xiang, Y., Ruan, N., Wang, H.: Efficiently answering reachability queries on very large directed graphs. In SIGMOD Conference, pp. 595-608 (2008)
29. Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45(2), 167-256 (2003)
30. Simon, K.: An improved algorithm for transitive closure on acyclic digraphs. Theor. Comput. Sci. 58(1-3), 325-346 (1988)
31. Stann, F., Heidemann, J.: Rmst: Reliable data transport in sensor networks. In 1st IEEE International Workshop on Sensor Net Protocols and Applications, pp. 102-112 (2003)
32. Trißl, S., Leser, U.: Fast and practical indexing and querying of very large graphs. In SIGMOD Conference, pp. 845-856 (2007)
33. van Schaik, S.J., de Moor, O.: Amemory efficient reachability data structure through bit vector compression. In SIGMOD Conference, pp. 913-924 (2011)
34. Wang, H., He, H., Yang, J., Yu, P.S., Yu, J.X.: Dual labeling: Answering graph reachability queries in constant time. In ICDE, p. 75 (2006)
35. Wei, F.: TEDI: Efficient shortest path query answering on graphs. In SIGMOD Conference, pp. 99-110 (2010)
36. Xiao, Y., Wu, W., Pei, J., Wang, W., He, Z.: Efficiently indexing shortest paths by exploiting symmetry in graphs. In EDBT, pp. 493-504 (2009)
37. Yildirim, H., Chaoji, V., Zaki, M.J.: Grail: Scalable reachability index for large graphs. PVLDB 3(1), 276-284 (2010)
38. Zhu, L., Choi, B., He, B., Yu, J.X., Ng, W.K.:Auniform framework for ad-hoc indexes to answer reachability queries on large graphs. In DASFAA, pp. 138-152 (2009)