Kreach: Who is in your small world

Proceedings of the VLDB Endowment

Volumn 5, Issue 11, 2012, Pages 1292-1303

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

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c MICROSOFT RESEARCH ASIA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; GRAPH THEORY;

DIRECTED PATHS; INPUT GRAPHS; REACHABILITY; REACHABILITY QUERIES; REAL DATA SETS; SHORTEST PATH QUERIES; SMALL WORLDS; TARGET QUERY;

QUERY PROCESSING;

EID: 84873209059     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/2350229.2350247     Document Type: Article

References (34)

1. I. Abraham, A. Fiat, A. V. Goldberg, and R. F. F. Werneck. Highway dimension, shortest paths, and provably efficient algorithms. In SODA, pages 782-793, 2010.
2. R. Agrawal, A. Borgida, and H. V. Jagadish. Efficient management of transitive relationships in large data and knowledge bases. In SIGMOD Conference, pages 253-262, 1989.
3. R. Bramandia, B. Choi, and W. K. Ng. On incremental maintenance of 2-hop labeling of graphs. In WWW, pages 845-854, 2008.
4. B. Bresar, F. Kardos, J. Katrenic, and G. Semanisin. Minimum k-path vertex cover. Discrete Applied Mathematics, 159(12):1189-1195, 2011.
5. L. Chen, A. Gupta, and M. E. Kurul. Stack-based algorithms for pattern matching on DAGs. In VLDB, pages 493-504, 2005.
6. Y. Chen and Y. Chen. An efficient algorithm for answering graph reachability queries. In ICDE, pages 893-902, 2008.
7. Y. Chen and Y. Chen. Decomposing DAGs into spanning trees: A new way to compress transitive closures. In ICDE, pages 1007-1018, 2011.
8. J. Cheng, Y. Ke, S. Chu, and C. Cheng. Efficient processing of distance queries in large graphs: a vertex cover approach. In SIGMOD Conference, pages 457-468, 2012.
9. J. Cheng, Y. Ke, A. W.-C. Fu, and J. X. Yu. Fast graph query processing with a low-cost index. VLDB Journal, 20(4):521-539, 2011.
10. J. Cheng, Y. Ke, A. W.-C. Fu, J. X. Yu, and L. Zhu. Finding maximal cliques in massive networks by h*-graph. In SIGMOD Conference, pages 447-458, 2010.
11. J. Cheng, Y. Ke, A. W.-C. Fu, J. X. Yu, and L. Zhu. Finding maximal cliques in massive networks. ACM Trans. Database Syst., 36(4):21:1-21:34, 2011.
12. J. Cheng, Y. Ke, W. Ng, and A. Lu. Fg-index: towards verification-free query processing on graph databases. In SIGMOD Conference, pages 857-872, 2007.
13. J. Cheng and J. X. Yu. On-line exact shortest distance query processing. In EDBT, pages 481-492, 2009.
14. J. Cheng, J. X. Yu, X. Lin, H. Wang, and P. S. Yu. Fast computation of reachability labeling for large graphs. In EDBT, pages 961-979, 2006.
15. 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 EDBT, pages 193-204, 2008.
16. J. Cheng, J. X. Yu, and N. Tang. Fast reachability query processing. In DASFAA, pages 674-688, 2006.
17. E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. In SODA, pages 937-946, 2002.
18. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, Second Edition. The MIT Press and McGraw-Hill Book Company, 2001.
19. H. V. Jagadish. A compression technique to materialize transitive closure. ACM Trans. Database Syst., 15(4):558-598, 1990.
20. R. Jin, H. Hong, H. Wang, N. Ruan, and Y. Xiang. Computing label-constraint reachability in graph databases. In SIGMOD Conference, pages 123-134, 2010.
21. R. Jin, L. Liu, B. Ding, and H. Wang. Distance-constraint reachability computation in uncertain graphs. PVLDB, 4(9):551-562, 2011.
22. R. Jin, N. Ruan, S. Dey, and J. X. Yu. Scarab: scaling reachability computation on large graphs. In SIGMOD Conference, pages 169-180, 2012.
23. R. Jin, Y. Xiang, N. Ruan, and D. Fuhry. 3-hop: a high-compression indexing scheme for reachability query. In SIGMOD Conference, pages 813-826, 2009.
24. R. Jin, Y. Xiang, N. Ruan, and H. Wang. Efficiently answering reachability queries on very large directed graphs. In SIGMOD Conference, pages 595-608, 2008.
25. M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45(2):167-256, 2003.
26. K. Simon. An improved algorithm for transitive closure on acyclic digraphs. Theor. Comput. Sci., 58(1-3):325-346, 1988.
27. S. Trißl and U. Leser. Fast and practical indexing and querying of very large graphs. In SIGMOD Conference, pages 845-856, 2007.
28. S. J. van Schaik and O. de Moor. A memory efficient reachability data structure through bit vector compression. In SIGMOD Conference, pages 913-924, 2011.
29. H. Wang, H. He, J. Yang, P. S. Yu, and J. X. Yu. Dual labeling: Answering graph reachability queries in constant time. In ICDE, page 75, 2006.
30. F. Wei. TEDI: efficient shortest path query answering on graphs. In SIGMOD Conference, pages 99-110, 2010.
31. Y. Xiao, W. Wu, J. Pei, W. Wang, and Z. He. Efficiently indexing shortest paths by exploiting symmetry in graphs. In EDBT, pages 493-504, 2009.
32. H. Yildirim, V. Chaoji, and M. J. Zaki. Grail: Scalable reachability index for large graphs. PVLDB, 3(1):276-284, 2010.
33. J. X. Yu and J. Cheng. Graph reachability queries: A survey. In Managing and Mining Graph Data, pages 181-215. 2010.
34. L. Zhu, B. Choi, B. He, J. X. Yu, and W. K. Ng. A uniform framework for ad-hoc indexes to answer reachability queries on large graphs. In DASFAA, pages 138-152, 2009.