Efficient management of transitive relationships in large data and knowledge bases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
A compression technique to materialize transitive closure
ACM Transactions on Database Systems (TODS)
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Reachability and Distance Queries via 2-Hop Labels
SIAM Journal on Computing
Stack-based algorithms for pattern matching on DAGs
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Dual Labeling: Answering Graph Reachability Queries in Constant Time
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Fast and practical indexing and querying of very large graphs
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Fast computing reachability labelings for large graphs with high compression rate
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Efficiently answering reachability queries on very large directed graphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
An Efficient Algorithm for Answering Graph Reachability Queries
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
3-HOP: a high-compression indexing scheme for reachability query
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Path-hop: efficiently indexing large graphs for reachability queries
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Set cover algorithms for very large datasets
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
GRAIL: scalable reachability index for large graphs
Proceedings of the VLDB Endowment
Path-tree: An efficient reachability indexing scheme for large directed graphs
ACM Transactions on Database Systems (TODS)
A memory efficient reachability data structure through bit vector compression
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Decomposing DAGs into spanning trees: A new way to compress transitive closures
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Highway hierarchies hasten exact shortest path queries
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Fast computation of reachability labeling for large graphs
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
K-reach: who is in your small world
Proceedings of the VLDB Endowment
Efficient ad-hoc search for personalized PageRank
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
TF-Label: a topological-folding labeling scheme for reachability querying in a large graph
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Database research challenges and opportunities of big graph data
BNCOD'13 Proceedings of the 29th British National conference on Big Data
Simple, fast, and scalable reachability oracle
Proceedings of the VLDB Endowment
Efficient processing of label-constraint reachability queries in large graphs
Information Systems
Hi-index | 0.00 |
Most of the existing reachability indices perform well on small- to medium- size graphs, but reach a scalability bottleneck around one million vertices/edges. As graphs become increasingly large, scalability is quickly becoming the major research challenge for the reachability computation today. Can we construct indices which scale to graphs with tens of millions of vertices and edges? Can the existing reachability indices which perform well on moderate-size graphs be scaled to very large graphs? In this paper, we propose SCARAB (standing for SCAlable ReachABility), a unified reachability computation framework: it not only can scale the existing state-of-the-art reachability indices, which otherwise could only be constructed and work on moderate size graphs, but also can help speed up the online query answering approaches. Our experimental results demonstrate that SCARAB can perform on graphs with millions of vertices/edges and is also much faster then GRAIL, the state-of-the-art scalability index approach.