Computing label-constraint reachability in graph databases
- Authors: Jin, Ruoming , Hong, Hui , Wang, Haixun , Ruan, Ning , Yang, Xiang
- Date: 2010
- Type: Text , Conference paper
- Relation: SIGMOD '10: Proceedings of the 2010 ACM SIGMOD International Conference on Management of data,
- Full Text: false
- Reviewed:
- Description: Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graphs, i.e., each edge has a label that denotes the relationship between the two vertices connected by the edge. A fundamental research problem on these labeled graphs is how to handle the label-constraint reachability query: Can vertex u reach vertex v through a path whose edge labels are constrained by a set of labels? In this work, we introduce a novel tree-based index framework which utilizes the directed maximal weighted spanning tree algorithm and sampling techniques to maximally compress the generalized transitive closure for the labeled graphs. An extensive experimental evaluation on both real and synthetic datasets demonstrates the efficiency of our approach in answering label-constraint reachability queries.
Efficiently answering reachability queries on very large directed graphs
- Authors: Jin, Ruoming , Xiang, Yang , Ruan, Ning , Wang, Haixun
- Date: 2008
- Type: Text , Conference paper
- Relation: SIGMOD '08 Proceedings of the 2008 ACM SIGMOD international conference on Management of data, p. 595-608
- Full Text: false
- Reviewed:
- Description: Efficiently processing queries against very large graphs is an important research topic largely driven by emerging real world applications, as diverse as XML databases, GIS, web mining, social network analysis, ontologies, and bioinformatics. In particular, graph reachability has attracted a lot of research attention as reachability queries are not only common on graph databases, but they also serve as fundamental operations for many other graph queries. The main idea behind answering reachability queries in graphs is to build indices based on reachability labels. Essentially, each vertex in the graph is assigned with certain labels such that the reachability between any two vertices can be determined by their labels. Several approaches have been proposed for building these reachability labels; among them are interval labeling (tree cover) and 2-hop labeling. However, due to the large number of vertices in many real world graphs (some graphs can easily contain millions of vertices), the computational cost and (index) size of the labels using existing methods would prove too expensive to be practical. In this paper, we introduce a novel graph structure, referred to as path-tree, to help labeling very large graphs. The path-tree cover is a spanning subgraph of G in a tree shape. We demonstrate both analytically and empirically the effectiveness of our new approaches.
Path-tree: An efficient reachability indexing scheme for large directed graphs
- Authors: Jin, Ruoming , Ruan, Ning , Xiang, Yang , Wang, Haixun
- Date: 2011
- Type: Text , Journal article
- Relation: ACM Transactions on Database Systems Vol. 36, no. 1 (2011), p.
- Full Text: false
- Reviewed: