8 citations · 40 across the 22 of their papers we have counts for
Showing 2012 · cs.DBShow all
2 papers · 2 filters
cs.DB2012★ 3 cited
K-Reach: Who is in Your Small World
James Cheng, Zechao Shang, Hong Cheng +2
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 que…
cs.DB2012★ 2 cited
Diversifying Top-K Results
Lu Qin, Jeffrey Xu Yu, Lijun Chang
Top-k query processing finds a list of k results that have largest scores w.r.t the user given query, with the assumption that all the k results are independent to each other. In p…