Database Paper Browser

Back to papers

Keyword-aware Optimal Route Search

Summary: Defines keyword-aware optimal route (KOR) queries requiring keyword coverage, a travel budget, and optimal route objective; KOR is NP-hard. Proposes OSScaling with provable bounds, plus BucketBound and Greedy variants; empirical results show scalable, fast solutions with bounded approximation. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10352
Venue
VLDB
Year
2012
Pagerank
6.9428691e-05
Overall Rank
3,588 | 75.05%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

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

Rank Cited Paper Year Venue Pagerank
648 Efficient Retrieval of the Top-k Most Relevant Spatial Web Objects 2009 VLDB 0.00018666267
4,525 Retrieving Top-k Prestige-Based Relevant Spatial Web Objects 2010 VLDB 6.1116751e-05
4,782 Interactive Route Search in the Presence of Order Constraints 2010 VLDB 5.9256393e-05
4,786 Collective Spatial Keyword Querying 2011 SIGMOD 5.9235651e-05
Previous Page 1 / 1 Next

Semantically Similar Papers