Xian Tang1,*, Ziyang Chen2, Haiyan Zhang3, Xiang Liu1, Yunyu Shi1, Asad Shahzadi4
CMC-Computers, Materials & Continua, Vol.55, No.2, pp. 267-283, 2018, DOI:10.3970/cmc.2018.01839
Abstract 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, G1 and G2. For G1, we… More >
Login
Register
