科研之友
微信
新浪微博
Facebook
分享链接
摘要
Answering reachability queries is one of the fundamental graph operations. Existing approaches either accelerate index construction by constructing an index that covers only partial reachability relationship, which may result in performing cost traversing operation when answering a query; or accelerate query answering by constructing an index covering the complete reachability relationship, which may be inefficient due to comparing the complete node labels. We propose a novel labeling scheme, which covers the complete reachability relationship, to accelerate reachability queries processing. The idea is to decompose the given directed acyclic graph (DAG) G into two subgraphs, G(1) and G(2). For G(1), we propose to use topological labels consisting of two integers to answer all reachability queries. For G(2), we construct 2-hop labels as existing methods do to answer queries that cannot be answered by topological labels. The benefits of our method lie in two aspects. On one hand, our method does not need to perform the cost traversing operation when answering queries. On the other hand, our method can quickly answer most queries in constant time without comparing the whole node labels. We confirm the efficiency of our approaches by extensive experimental studies using 20 real datasets.
