Path-tree: An efficient reachability indexing scheme for large directed graphs

ACM Transactions on Database Systems

Volumn 36, Issue 1, 2011, Pages

  Jin, Ruoming ^a   Ruan, Ning ^a   Xiang, Yang ^b   Wang, Haixun ^c  

^a KENT STATE UNIVERSITY   (United States)

^b OHIO STATE UNIVERSITY   (United States)

^c MICROSOFT RESEARCH ASIA   (China)

Author keywords

Graph indexing; Maximal directed spanning tree; Path tree cover; Reachability queries; Transitive closure

Indexed keywords

GRAPH INDEXING; MAXIMAL DIRECTED SPANNING TREE; PATH-TREE COVER; REACHABILITY QUERIES; TRANSITIVE CLOSURE;

GRAPH THEORY; INDEXING (OF INFORMATION); PARALLEL ARCHITECTURES; QUERY LANGUAGES; QUERY PROCESSING;

TREES (MATHEMATICS);

EID: 79953234479     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1929934.1929941     Document Type: Article

References (26)

1. ADLER, M. AND MITZENMACHER, M. 2001. Towards compressing web graphs. In Proceedings of the Data Compression Conference. IEEE, 203-212. (Pubitemid 32490992)
2. AGRAWAL, R.,BORGIDA, A., AND JAGADISH,H. 1989. Efficient management of transitive relationships in large data and knowledge bases. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM, 253-262.
3. BOUROS, P., SKIADOPOULOS, S., DALAMAGAS, T., SACHARIDIS, D., AND SELLIS, T. K. 2009. Evaluating reachability queries over path collections. In Proceedings of the International Conference on Statistical and Scientific Database Management (SSDBM). 398-416.
4. CHEN, L.,GUPTA, A., ANDKURUL,M. 2005. Stack-based algorithms for pattern matching on dags. In Proceedings of the 31st International Conference on Very Large Data Bases. VLDB Endowment, 493-504. (Pubitemid 43991028)
5. CHENG, J., YU, J. X., LIN, X., WANG, H., AND YU, P. S. 2006. Fast computation of reachability labeling for large graphs. In Proceedings of the International Conference on Extending Database Technology (EDBT). 961-979. (Pubitemid 43986862)
6. CHU, Y. J. AND LIU, T. H. 1965. On the shortest arborescence of a directed graph. Sci. Sinica 14, 1396-1400.
7. COHEN, E., HALPERIN, E., KAPLAN, H., AND ZWICK, U. 2003. Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32, 5, 1338-1355.
8. CORMEN, T. H., LEISERSON, C. E., RIVEST, R. L., AND STEIN, C. 2001. Introduction to Algorithms. MIT Press.
9. DE BERG, M., CHEONG, O., VAN KREVELD, M., AND OVERMARS, M. 2008. Computational Geometry: Algorithms and Applications 3rd Ed. Springer-Verlag.
10. DILWORTH, R. P. 1950. A decomposition theorem for partially ordered sets. Ann. Math., 2nd Series 51, 1, 161-166.
11. EDMONDS, J. 1967. Optimum branchings. J. Res. Natl. Bureau Stand. 71B, 233-240.
12. GABOW, H. N., GALIL, Z., SPENCER, T., AND TARJAN, R. E. 1986. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica 6, 2, 109-122.
13. GOLDBERG, A. V., TARDOS, E., AND TARJAN, R. E. 1990. Network Flow Algorithms. Springer Verlag, 101-164.
14. JAGADISH, H. V. 1990. A compression technique to materialize transitive closure. ACM Trans. Datab. Syst. 15, 4, 558-598.
15. JIN, R., HONG, H.,WANG, H., RUAN, N., AND XIANG, Y. 2010. Computing label-constraint reachability in graph databases. In Proceedings of the SIGMOD Conference. 123-134.
16. JIN, R., XIANG, Y., RUAN, N., AND FUHRY, D. 2009. 3-hop: A high-compression indexing scheme for reachability query. In Proceedings of the SIGMOD Conference. 813-826.
17. JIN, R., XIANG, Y., RUAN, N., AND WANG, H. 2008. Efficiently answering reachability queries on very large directed graphs. In Proceedings of the SIGMOD Conference. 595-608.
18. KAMEDA, T. 1975. On the vector representation of the reachability in planar directed graphs 1. Inform. Process. Lett. 3, 3, 75-77.
19. KÖNIG, J. 1884. Über eine eigenschaft der potenzreihen. Math. Ann. 23, 447-449.
20. NAVLAKHA, S.,RASTOGI, R., AND SHRIVASTAVA, N. 2008. Graph summarization with bounded error. In Proceedings of the SIGMOD Conference. 419-432.
21. RAGHAVAN, S. AND GARCIA-MOLINA, H. 2003. Representing web graphs. In Proceedings of the International Conference on Data Engineering (ICDE). 405-416.
22. SCHENKEL, R., THEOBALD, A., AND WEIKUM, G. 2004. Hopi: An efficient connection index for complex xml document collections. In Proceedings of the International Conference on Extending Database Technology (EDBT). 237-255.
23. SIMON, K. 1988. An improved algorithm for transitive closure on acyclic digraphs. Theor. Comput. Sci. 58, 1-3, 325-346.
24. TRISSL, S. AND LESER, U. 2007. Fast and practical indexing and querying of very large graphs. In Proceedings of the SIGMOD Conference. 845-856. (Pubitemid 47630858)
25. WANG, H.,HE, H., YANG, J., YU, P. S., AND YU, J. X. 2006. Dual labeling: Answering graph reachability queries in constant time. In Proceedings of the International Conference on Data Engineering (ICDE). 75.
26. YILDIRIM, H., CHAOJI, V., AND ZAKI, M. J. 2010. Grail: Scalable reachability index for large graphs. Proc. VLDB Endow. 3, 276-284.