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
Partitioning sparse matrices with eigenvectors of graphs
SIAM Journal on Matrix Analysis and Applications
Maintaining order in a linked list
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Reachability and Distance Queries via 2-Hop Labels
SIAM Journal on Computing
A Prime Number Labeling Scheme for Dynamic Ordered XML Trees
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Efficient Algorithms for Pattern Matching on Directed Acyclic Graphs
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Stack-based algorithms for pattern matching on DAGs
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Discovering large dense subgraphs in massive graphs
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Compact reachability labeling for graph-structured data
Proceedings of the 14th ACM international conference on Information and knowledge management
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
Efficiently answering reachability queries on very large directed graphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Adapting prime number labeling scheme for directed acyclic graphs
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Fast computation of reachability labeling for large graphs
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
A memory efficient reachability data structure through bit vector compression
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Predicting the optimal ad-hoc index for reachability queries on graph databases
Proceedings of the 20th ACM international conference on Information and knowledge management
K-reach: who is in your small world
Proceedings of the VLDB Endowment
Simple, fast, and scalable reachability oracle
Proceedings of the VLDB Endowment
Hi-index | 0.02 |
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databases, social network analysis and the Semantic Web. To efficiently evaluate reachability queries on large graph-structured databases, there has been a host of recent research on graph indexing. To date, reachability indexes are generally applied to the entire graph. This can often be suboptimal if the graph is large or/and its subgraphs are diverse in structure. In this paper, we propose a uniform framework to support existing reachability indexing for subgraphs of a given graph. This in turn supports fast reachability query processing in large graph-structured databases. The contributions of our uniform framework are as follows: (1) We formally define a graph framework that facilitates indexing subgraphs, as opposed to the entire graph. (2) We propose a heuristic algorithm to partition a given graph into subgraphs for indexing. (3) We demonstrate how reachability queries are evaluated in the graph framework. Our preliminary experimental results showed that the framework yields a smaller total index size and is more efficient in processing reachability queries on large graphs than a fixed index scheme on the entire graphs.