TF-label: A topological-folding labeling scheme for reachability querying in a large graph

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2013, Pages 193-204

  Cheng, James ^a   Huang, Silu ^a   Wu, Huanhuan ^a   Fu, Ada Wai Chee ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Graph indexing; Graph querying; Graph reachability

Indexed keywords

COMPUTATIONAL BIOLOGY; GRAPH INDEXING; GRAPH QUERYING; INDEX CONSTRUCTION; OPTIMIZATION SCHEME; REACHABILITY; REACHABILITY QUERIES; STATE-OF-THE-ART METHODS;

ALGORITHMS; BIOINFORMATICS; QUERY PROCESSING; SOFTWARE ENGINEERING;

TOPOLOGY;

EID: 84880555012     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2463676.2465286     Document Type: Conference Paper

References (29)

1. 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.
2. R. Bramandia, B. Choi, and W. K. Ng. On incremental maintenance of 2-hop labeling of graphs. In WWW, pages 845-854, 2008.
3. J. Cai and C. K. Poon. Path-hop: efficiently indexing large graphs for reachability queries. In CIKM, pages 119-128, 2010.
4. L. Chen, A. Gupta, and M. E. Kurul. Stack-based algorithms for pattern matching on DAGs. In VLDB, pages 493-504, 2005.
5. Y. Chen and Y. Chen. An efficient algorithm for answering graph reachability queries. In ICDE, pages 893-902, 2008.
6. Y. Chen and Y. Chen. Decomposing DAGs into spanning trees: A new way to compress transitive closures. In ICDE, pages 1007-1018, 2011.
7. 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.
8. *-graph. In SIGMOD Conference, pages 447-458, 2010.
9. 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, 2011.
10. J. Cheng, Z. Shang, H. Cheng, H. Wang, and J. X. Yu. K-reach: Who is in your small world. PVLDB, 5(11):1292-1303, 2012.
11. 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.
12. 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.
13. S. Chu and J. Cheng. Triangle listing in massive networks. TKDD, 6(4):17, 2012.
14. E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. In SODA, pages 937-946, 2002.
15. T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to algorithms. MIT press, 2001.
16. A. W.-C. Fu, H. Wu, J. Cheng, and R. C.-W. Wong. Is-label: an independent-set based labeling scheme for point-to-point distance querying. PVLDB.
17. H. V. Jagadish. A compression technique to materialize transitive closure. ACM Trans. Database Syst., 15(4):558-598, 1990.
18. R. Jin, N. Ruan, S. Dey, and J. X. Yu. Scarab: scaling reachability computation on large graphs. In SIGMOD Conference, pages 169-180, 2012.
19. R. Jin, N. Ruan, Y. Xiang, and H. Wang. Path-tree: An efficient reachability indexing scheme for large directed graphs. ACM Trans. Database Syst., 36(1):7, 2011.
20. 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.
21. R. Schenkel, A. Theobald, and G. Weikum. Hopi: An efficient connection index for complex xml document collections. In EDBT, pages 237-255, 2004.
22. S. Seufert, A. Anand, S. J. Bedathur, and G. Weikum. Ferrari: Flexible and efficient reachability range assignment for graph indexing. In ICDE, 2012.
23. K. Simon. An improved algorithm for transitive closure on acyclic digraphs. Theor. Comput. Sci., 58(1-3):325-346, 1988.
24. S. Trißl and U. Leser. Fast and practical indexing and querying of very large graphs. In SIGMOD Conference, pages 845-856, 2007.
25. S. J. van Schaikand O. de Moor. A memory efficient reachability data structure through bit vector compression. In SIGMOD Conference, pages 913-924, 2011.
26. 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.
27. J. Wang and J. Cheng. Truss decomposition in massive networks. PVLDB, 5(9):812-823, 2012.
28. H. Yildirim, V. Chaoji, and M. J. Zaki. Grail: Scalable reachability index for large graphs. PVLDB, 3(1):276-284, 2010.
29. J. X. Yu and J. Cheng. Graph reachability queries: A survey. In Managing and Mining Graph Data, pages 181-215. 2010.