Computing label-constraint reachability in graph databases

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. Categories and Subject Descriptors H.2.8 [Database management]: Database Applications—graph i...

• Type: Conference
• Year: 2010
• Where: SIGMOD
• Authors: Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yang Xiang
• Keywords: Database, Label-constraint Reachability, Label-constraint Reachability Query, SIGMOD 2010, Transitive Closure