Database Paper Browser

Back to papers

Top-K Nearest Keyword Search on Large Graphs

Summary: Introduces top-k nearest keyword (k-NK) search on large labeled graphs, leveraging an enhanced distance oracle to build a shortest-path tree for precise distance estimation. Reduces k-NK on graphs to queries on trees, with two exact tree algorithms (small-k optimal, large-k scalable) and a global storage technique to shrink index size and speed up assembly. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10751
Venue
VLDB
Year
2013
Pagerank
4.4958064e-05
Overall Rank
8,505 | 40.84%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
7,277 Exact Top-k Nearest Keyword Search in Large Networks 2015 SIGMOD 4.7794907e-05
11,239 TASK: An Efficient Framework for Instant Error-tolerant Spatial Keyword Queries on Road Networks 2023 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers