Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/102236
Full metadata record
DC FieldValueLanguage
dc.contributor.authorCheng, Jamesen
dc.contributor.authorShang, Zechaoen
dc.contributor.authorCheng, Hongen
dc.contributor.authorWang, Haixunen
dc.contributor.authorYu, Jeffrey Xuen
dc.date.accessioned2014-03-20T09:07:47Zen
dc.date.accessioned2019-12-06T20:52:05Z-
dc.date.available2014-03-20T09:07:47Zen
dc.date.available2019-12-06T20:52:05Z-
dc.date.copyright2012en
dc.date.issued2012en
dc.identifier.citationCheng, 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.en
dc.identifier.urihttps://hdl.handle.net/10356/102236-
dc.identifier.urihttp://hdl.handle.net/10220/18931en
dc.description.abstractWe 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.en
dc.language.isoenen
dc.relation.ispartofseriesProceedings of the VLDB endowmenten
dc.rights© 2012 VLDB Endowment.en
dc.subjectDRNTU::Engineering::Computer science and engineeringen
dc.titleK-reach : who is in your small worlden
dc.typeJournal Articleen
dc.contributor.schoolSchool of Computer Engineeringen
dc.identifier.urlhttp://dl.acm.org.ezlibproxy1.ntu.edu.sg/citation.cfm?id=2350247&dl=ACM&coll=DLen
item.grantfulltextnone-
item.fulltextNo Fulltext-
Appears in Collections:SCSE Journal Articles

Google ScholarTM

Check

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.