Dual Labeling: Answering Graph Reachability Queries in Constant Time

Graph reachability is fundamental to a wide range of applications, including XML indexing, geographic navigation, Internet routing, ontology queries based on RDF/OWL, etc. Many applications involve huge graphs and require fast answering of reachability queries. Several reachability labeling methods have been proposed for this purpose. They assign labels to the vertices, such that the reachability between any two vertices may be decided using their labels only. For sparse graphs, 2-hop based reachability labeling schemes answer reachability queries efficiently using relatively small label space. However, the labeling process itself is often too time consuming to be practical for large graphs. In this paper, we propose a novel labeling scheme for sparse graphs. Our scheme ensures that graph reachability queries can be answered in constant time. Furthermore, for sparse graphs, the complexity of the labeling process is almost linear, which makes our algorithm applicable to massive dataset...

• Type: Conference
• Year: 2006
• Where: ICDE
• Authors: Haixun Wang, Hao He, Jeffrey Xu Yu, Jun Yang 0001, Philip S. Yu
• Keywords: Database, Graph Reachability Queries, ICDE 2006, Reachability Labeling Methods, Reachability Labeling Schemes