GRAIL: Scalable reachability index for large graphs

Proceedings of the VLDB Endowment

Volumn 3, Issue 1, 2010, Pages 276-284

  Yildirim, Hilmi ^a   Chaoji, Vineet ^b   Zaki, Mohammed J ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^b YAHOO RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; ECONOMIC AND SOCIAL EFFECTS; GRAPHIC METHODS; INDEXING (OF INFORMATION);

CONSTANT TIME; GRAPH ORDER; LARGE GRAPHS; REACHABILITY; REACHABILITY QUERIES; REAL-WORLD GRAPHS; SCALABLE REACHABILITY; TARGET NODES;

GRAPH THEORY;

EID: 79953233672     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1920841.1920879     Document Type: Article

References (23)

1. R. Agrawal, A. Borgida, and H. V. Jagadish. Efficient management of transitive relationships in large data and knowledge bases. SIGMOD Rec., 18(2):253-262, 1989.
2. P. Bouros, S. Skiadopoulos, T. Dalamagas, D. Sacharidis, and T. Sellis. Evaluating reachability queries over path collections. In SSDBM, page 416, 2009.
3. R. Bramandia, B. Choi, and W. K. Ng. On incremental maintenance of 2-hop labeling of graphs. In WWW, 2008.
4. Y. Chen. General spanning trees and reachability query evaluation. In Canadian Conference on Computer Science and Software Engineering, Montreal, Quebec, Canada, 2009.
5. Y. Chen and Y. Chen. An efficient algorithm for answering graph reachability queries. In ICDE, 2008.
6. 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 EBDT, 2008.
7. E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. SIAM Journal of Computing, 32(5):1335-1355, 2003.
8. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2001.
9. C. Demetrescu and G. Italiano. Fully Dynamic Transitive Closure: Breaking through the O(n2) Barrier. In FOCS, 2000.
10. C. Demetrescu and G. Italiano. Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures. Journal of Discrete Algorithms, 4(3):353-383, 2006.
11. P. F. Dietz. Maintaining order in a linked list. In STOC, 1982.
12. H. He, H. Wang, J. Yang, and P. S. Yu. Compact reachability labeling for graph-structured data. In CIKM, 2005.
13. H. V. Jagadish. A compression technique to materialize transitive closure. ACM Trans. Database Syst., 15(4):558-598, 1990.
14. R. Jin, Y. Xiang, N. Ruan, and D. Fuhry. 3-hop: a high-compression indexing scheme for reachability query. In SIGMOD, 2009.
15. R. Jin, Y. Xiang, N. Ruan, and H. Wang. Efficient answering reachability queries on very large directed graphs. In SIGMOD, 2008.
16. V. King and G. Sagert. A fully dynamic algorithm for maintaining the transitive closure. J. Comput. Syst. Sci., 65(1):150-167, 2002.
17. I. Krommidas and C. Zaroliagis. An experimental study of algorithms for fully dynamic transitive closure. Journal of Experimental Algorithmics, 12:16, 2008.
18. L. Roditty and U. Zwick. A fully dynamic reachability algorithm for directed graphs with an almost linear update time. In STOC, 2004.
19. R. Schenkel, A. Theobald, and G. Weikum. HOPI: an efficient connection index for complex XML document collections. In EBDT, 2004.
20. R. Schenkel, A. Theobald, and G. Weikum. Efficient creation and incremental maintenance of the hopi index for complex xml document collections. In ICDE, 2005.
21. S. Trissl and U. Leser. Fast and practical indexing and querying of very large graphs. In SIGMOD, 2007.
22. H. Wang, H. He, J. Yang, P. Yu, and J. X. Yu. Dual labeling: Answering graph reachability queries in constant time. In ICDE, 2006.
23. J. X. Yu, X. Lin, H. Wang, P. S. Yu, and J. Cheng. Fast computation of reachability labeling for large graphs. In EBDT, 2006.