Please use this identifier to cite or link to this item:
|Title:||K-reach : who is in your small world||Authors:||Cheng, James
Yu, Jeffrey Xu
|Keywords:||DRNTU::Engineering::Computer science and engineering||Issue Date:||2012||Source:||Cheng, J., Shang, Z., Cheng, H., Wang, H., & Yu, J. X. (2012). K-reach: who is in your small world. Proceedings of the VLDB Endowment, 5(11), 1292-1303.||Series/Report no.:||Proceedings of the VLDB endowment||Abstract:||We study the problem of answering k-hop reachability queries in a directed graph, i.e., whether there exists a directed path of length k, from a source query vertex to a target query vertex in the input graph. The problem of k-hop reachability is a general problem of the classic reachability (where k = ∞). Existing indexes for processing classic reachability queries, as well as for processing shortest path queries, are not applicable or not efficient for processing k-hop reachability queries. We propose an index for processing k-hop reachability queries, which is simple in design and efficient to construct. Our experimental results on a wide range of real datasets show that our index is more efficient than the state-of-the-art indexes even for processing classic reachability queries, for which these indexes are primarily designed. We also show that our index is efficient in answering k-hop reachability queries.||URI:||https://hdl.handle.net/10356/102236
|Rights:||© 2012 VLDB Endowment.||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||SCSE Journal Articles|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.