Access the full text.
Sign up today, get DeepDyve free for 14 days.
Paul Dietz (1982)
Maintaining order in a linked list
Yangjun Chen (2009)
General spanning trees and reachability query evaluation
Valerie King, Garry Sagert (1999)
A fully dynamic algorithm for maintaining the transitive closure
R. Jin, Yang Xiang, Ning Ruan, Haixun Wang (2008)
Efficiently answering reachability queries on very large directed graphs
Ioannis Krommidas, C. Zaroliagis (2005)
An experimental study of algorithms for fully dynamic transitive closure
Haixun Wang, Hao He, Jun Yang, Philip Yu, J. Yu (2006)
Dual Labeling: Answering Graph Reachability Queries in Constant Time22nd International Conference on Data Engineering (ICDE'06)
Jiefeng Cheng, J. Yu, Xuemin Lin, Haixun Wang, Philip Yu (2006)
Fast Computation of Reachability Labeling for Large Graphs
Jiefeng Cheng, J. Yu, Xuemin Lin, Haixun Wang, Philip Yu (2008)
Fast computing reachability labelings for large graphs with high compression rate
C. Demetrescu, G. Italiano (2006)
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structuresJ. Discrete Algorithms, 4
S. Trißl, U. Leser (2007)
Fast and practical indexing and querying of very large graphs
Li Chen, Amarnath Gupta, M. Kurul (2005)
Stack-based Algorithms for Pattern Matching on DAGs
Yangjun Chen, Yibin Chen (2008)
An Efficient Algorithm for Answering Graph Reachability Queries2008 IEEE 24th International Conference on Data Engineering
Table 20 Query time comparison of the baseline methods: deep positive queries Data set
H. Yildirim, V. Chaoji, M.J. Zaki (2010)
Grail: scalable reachability index for large graphsPVLDB, 3
L. Roditty, Uri Zwick (2004)
A fully dynamic reachability algorithm for directed graphs with an almost linear update timeSIAM J. Comput., 45
(2010)
Go Database Guide
E. Cohen, E. Halperin, Haim Kaplan, Uri Zwick (2002)
Reachability and distance queries via 2-hop labels
C. Demetrescu, G. Italiano (2000)
Fully dynamic transitive closure: breaking through the O(n/sup 2/) barrierProceedings 41st Annual Symposium on Foundations of Computer Science
E. Cohen (1994)
Estimating the size of the transitive closure in linear timeProceedings 35th Annual Symposium on Foundations of Computer Science
(2010)
Sparql 1.1 Query Language
(2010)
Snap network analysis library. http://snap
(2010)
Accessed 4
R. Jin, Yang Xiang, Ning Ruan, David Fuhry (2009)
3-HOP: a high-compression indexing scheme for reachability queryProceedings of the 2009 ACM SIGMOD International Conference on Management of data
Hao He, Haixun Wang, Jun Yang, Philip Yu (2005)
Compact reachability labeling for graph-structured data
E. Cohen (1997)
Size-Estimation Framework with Applications to Transitive Closure and ReachabilityJ. Comput. Syst. Sci., 55
Panagiotis Bouros, Spiros Skiadopoulos, Theodore Dalamagas, Dimitris Sacharidis, T. Sellis (2009)
Evaluating Reachability Queries over Path Collections
Ralf Schenkel, A. Theobald, G. Weikum (2005)
Efficient creation and incremental maintenance of the HOPI index for complex XML document collections21st International Conference on Data Engineering (ICDE'05)
H. Jagadish (1990)
A compression technique to materialize transitive closureACM Trans. Database Syst., 15
Zhe Wu, G. Eadon, Souripriya Das, E. Chong, Vladimir Kolovski, Melliyal Annamalai, Jagannathan Srinivasan (2008)
Implementing an Inference Engine for RDFS/OWL Constructs and User-Defined Rules in Oracle2008 IEEE 24th International Conference on Data Engineering
(2010)
W3c semantic web faq
Hilmi Yildirim, Vineet Chaoji, Mohammed Zaki (2010)
GRAILProceedings of the VLDB Endowment, 3
Ramadhana Bramandia, Byron Choi, W. Ng (2008)
On incremental maintenance of 2-hop labeling of graphs
Ralf Schenkel, A. Theobald, G. Weikum (2004)
HOPI: An Efficient Connection Index for Complex XML Document Collections
T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein (2001)
Introduction to Algorithms
Jannene McBride, N. Evans, D. Lambert, A. Andrew
Emergence of Scaling in Random Networks
R. Agrawal, Alexander Borgida, H. Jagadish (1989)
Efficient management of transitive relationships in large data and knowledge bases
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability tradeoff indexing time and space versus query time performance. However, the biggest limitation of existing methods is that they do not scale to very large real-world graphs. We present a simple yet scalable reachability index, called GRAIL, that is based on the idea of randomized interval labeling and that can effectively handle very large graphs. Based on an extensive set of experiments, we show that while more sophisticated methods work better on small graphs, GRAIL is the only index that can scale to millions of nodes and edges. GRAIL has linear indexing time and space, and the query time ranges from constant time to being linear in the graph order and size. Our reference C++ implementations are open source and available for download at http://www.code.google.com/p/grail/ .
The VLDB Journal – Springer Journals
Published: Aug 1, 2012
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.