Efficiently answering reachability queries on very large directed graphs

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2008, Pages 595-607

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

^a KENT STATE UNIVERSITY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

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

Indexed keywords

BIOINFORMATICS; DATABASE SYSTEMS; ELECTRIC NETWORK ANALYSIS; INDEXING (OF INFORMATION); INDUSTRIAL RESEARCH; LABELING; LABELS; MARKUP LANGUAGES; ONTOLOGY; TREES (MATHEMATICS);

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

GRAPH THEORY;

DATA BASES; ELECTRIC CIRCUITS; GRAPHIC METHODS; INDEXING; INFORMATION SYSTEMS; LABELING; RESEARCH;

EID: 57149132520     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1376616.1376677     Document Type: Conference Paper

References (16)

1. R. Agrawal, A. Borgida, and H. V. Jagadish. Efficient management of transitive relationships in large data and knowledge bases. In SIGMOD, pages 253-262, 1989.
2. Li Chen, Amarnath Gupta, and M. Erdem Kurul. Stack-based algorithms for pattern matching on dags. In VLDB '05: Proceedings of the 31st international conference on Very large data bases, pages 493-504, 2005.
3. Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun Wang, and Philip S. Yu. Fast computation of reachability labeling for large graphs. In EDBT, pages 961-979, 2006.
4. Y. J. Chu and T. H. Liu. On the shortest arborescence of a directed graph. Science Sinica, 14:1396-1400, 1965.
5. Edith Cohen, Eran Halperin, Haim Kaplan, and Uri Zwick. Reachability and distance queries via 2-hop labels. In Proceedings of the 13th annual ACM-SIAM Symposium on Discrete algorithms, pages 937-946, 2002.
6. Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. McGraw Hill, 1990.
7. Mark de Berg, M. van Krefeld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, second edition, 2000.
8. J. Edmonds. Optimum branchings. J. Research of the National Bureau of Standards, 71B:233-240, 1967.
9. H N Gabow, Z Galil, T Spencer, and R E Tarjan. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. ComUnatorica, 6(2): 109-122, 1986.
10. A. V. Goldberg, E. Tardos, and R. E. Tarjan. Network Flow Algorithms, pages 101-164. Springer Verlag, 1990.
11. H. V. Jagadish. A compression technique to materialize transitive closure. ACM Trans. Database Syst., 15(4): 558-598, 1990.
12. T. Kameda. On the vector representation of the reachability in planar directed graphs. Information Processing Letters, 3(3), January 1975.
13. R. Schenkel, A. Theobald, and G. Weikum. HOPI: An efficient connection index for complex XML document collections. In EDBT, 2004.
14. K. Simon. An improved algorithm for transitive closure on acyclic digraphs. Theor. Comput. Sci., 58(1-3) :325-346, 1988.
15. Silke Trißl and Ulf Leser. Fast and practical indexing and querying of very large graphs. In SIGMOD '07: Proceedings of the 2007 ACM SIGMOD international conference on Management of data, pages 845-856, 2007.
16. Haixun Wang, Hao He, Jun Yang, Philip S. Yu, and Jeffrey Xu Yu. Dual labeling: Answering graph reachability queries in constant time. In ICDE '06: Proceedings of the 22nd International Conference on Data Engineering (ICDE'06), page 75, 2006.