Database Paper Browser

Back to papers

Efficient Algorithms for Answering the m-Closest Keywords Query

Summary: mCK queries are NP-hard; a 2-approx greedy algorithm is developed. Circle-enclosure yields 2/√3 and (2/√3+ε) approximations, and an exact method uses the approximate group to beat prior work, with extensive real-dataset experiments. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4943
Venue
SIGMOD
Year
2015
Pagerank
5.8226582e-05
Overall Rank
4,925 | 65.74%
DOI
10.1145/2723372.2723723

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 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
2,149 Spatial Keyword Query Processing: An Experimental Evaluation 2013 VLDB 9.4266468e-05
3,514 Spatio-Textual Similarity Joins 2013 VLDB 7.0226998e-05
3,748 Collective Spatial Keyword Queries: A Distance Owner-Driven Approach 2013 SIGMOD 6.7912604e-05
4,786 Collective Spatial Keyword Querying 2011 SIGMOD 5.9235651e-05
5,232 SEAL: Spatio-Textual Similarity Search 2012 VLDB 5.6136151e-05
7,281 Retrieving Regions of Interest for User Exploration 2014 VLDB 4.7770174e-05
Previous Page 1 / 1 Next

Semantically Similar Papers