SCARAB: Scaling reachability computation on large graphs

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2012, Pages 169-180

  Jin, Ruoming ^a   Ruan, Ning ^a   Dey, Saikat ^a   Xu, Jeffrey Yu ^b  

^a KENT STATE UNIVERSITY   (United States)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

reachability backbone; reachability join test; scalable reachability

Indexed keywords

AS GRAPH; LARGE GRAPHS; QUERY ANSWERING; REACHABILITY; REACHABILITY INDEX; RESEARCH CHALLENGES;

SCALABILITY;

GRAPHIC METHODS;

EID: 84862661278     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213836.2213856     Document Type: Conference Paper

References (25)

1. R. Agrawal, A. Borgida, and H. V. Jagadish. Efficient mgmt. transitive relationships in large data and knowledge bases. In SIGMOD, pages 253-262, 1989.
2. A. V. Aho, M. R. Garey, and J. D. Ullman. The transitive reduction of a directed graph. SIAM Journal on Computing, 1(2):131-137, 1972.
3. H. Bast, S. Funke, P. Sanders, and D. Schultes. Fast Routing in Road Networks with Transit Nodes. Science, 316:566-, April 2007.
4. J. Cai and C. K. Poon. Path-hop: efficiently indexing large graphs for reachability queries. In CIKM '10, 2010.
5. L. Chen, A. Gupta, and M. E. Kurul. Stack-based algorithms for pattern matching on dags. In VLDB '05, pages 493-504, 2005.
6. Y. Chen and Y. Chen. An efficient algorithm for answering graph reachability queries. In ICDE, 2008.
7. Y. Chen and Y. Chen. Decomposing dags into spanning trees: A new way to compress transitive closures. In ICDE'11, 2011.
8. J. Cheng, J. X. Yu, X. Lin, H. Wang, and P. S. Yu. Fast computation of reachability labeling for large graphs. In EDBT, 2006.
9. 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, 2008.
10. Edith Cohen, Eran Halperin, Haim Kaplan, and Uri Zwick. Reachability and distance queries via 2-hop labels. SIAM J. Comput., 32(5):1338-1355, 2003.
11. G. Cormode, H. Karloff, and A. Wirth. Set cover algorithms for very large datasets. In CIKM '10, pages 479-488, 2010.
12. U. Feige. A threshold of ln n for approximating set cover. J. ACM, 45(4):634-652, 1998. (Pubitemid 128488790)
13. H. V. Jagadish. A compression technique to materialize transitive closure. ACM Trans. Database Syst., 15(4):558-598, 1990.
14. R. Jin, N. Ruan, Y. Xiang, and H. Wang. Path-tree: An efficient reachability indexing scheme for large directed graphs. TODS, 36(1), 2011.
15. R. Jin, Y. Xiang, N. Ruan, and D. Fuhry. 3-hop: a high-compression indexing scheme for reachability query. In SIGMOD'09, 2009.
16. R. Jin, Y. Xiang, N. Ruan, and H. Wang. Efficiently answering reachability queries on very large directed graphs. In SIGMOD'08, 2008.
17. M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45(2):167-256, 2003.
18. E. Nuutila. Efficient Transitive Closure Computation in Large Digraphs. PhD thesis, Finnish Academy of Technology, 1995.
19. P. Sanders and D. Schultes. Highway hierarchies hasten exact shortest path queries. In 17th Eur. Symp. Algorithms (ESA), 2005.
20. R. Schenkel, A. Theobald, and G. Weikum. HOPI: An efficient connection index for complex XML document collections. In EDBT, 2004.
21. S. Trißl and U. Leser. Fast and practical indexing and querying of very large graphs. In SIGMOD '07, 2007.
22. S. J. van Schaik and O. de Moor. A memory efficient reachability data structure through bit vector compression. In SIGMOD '11, pages 913-924, 2011.
23. H. Wang, H. He, J. Yang, P. S. Yu, and J. X. Yu. Dual labeling: Answering graph reachability queries in constant time. In ICDE '06, page 75, 2006.
24. H. Yildirim, V. Chaoji, and M. J. Zaki. Grail: Scalable reachability index for large graphs. PVLDB, pages 276-284, 2010.
25. 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 '09, 2009.