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
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Reachability and distance queries via 2-hop labels
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Analysis of navigation behaviour in web sites integrating multiple information systems
The VLDB Journal — The International Journal on Very Large Data Bases
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
An evaluation of XML indexes for structural join
ACM SIGMOD Record
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Efficient structural joins on indexed XML documents
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
XMark: a benchmark for XML data management
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Labeling scheme and structural joins for graph-structured XML data
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
On incremental maintenance of 2-hop labeling of graphs
Proceedings of the 17th international conference on World Wide Web
Optimizing updates of recursive XML views of relations
The VLDB Journal — The International Journal on Very Large Data Bases
Cost-based query optimization for multi reachability joins
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
R2DF framework for ranked path queries over weighted RDF graphs
Proceedings of the International Conference on Web Intelligence, Mining and Semantics
K-reach: who is in your small world
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
Graph has great expressive power to describe the complex relationships among data objects, and there are large graph datasets available. In this paper, we focus ourselves on processing a primitive graph query. We call it reachability query. The reachability query, denoted $A \rightsquigarrow D$, is to find all elements of a type D that are reachable from some elements in another type A. The problem is challenging because the existing structural join algorithms, studied in XML query processing, cannot be directly applied to it, because those techniques make use of the tree-structure heavily. We propose a novel approach which can process reachability queries on the fly while keeping the space consumption small that is needed to keep the required information for processing reachability queries. In brief, our approach is based on 2-hop labeling for a directed graph G which consumes O(|V|log|E|) space. We construct a novel join-index which is built on a small table and B+-tree. With the join-index, the high efficiency is achieved. We conducted extensive experimental studies, and we confirm that our approach can efficiently process reachability queries over a graph or a tree.