Database Paper Browser

Back to papers

Finding and Approximating Top-k Answers in Keyword Proximity Search

Summary: Under data complexity, an efficient top-1 algorithm for keyword-proximity Q-fragments yields polynomial-delay algorithms for ranked enumeration and top-k computation. With query-and-data complexity, a θ-approximate top-1 yields (θ+1)-approximate ranked enumeration and top-k, giving the first provable approximate enumeration/top-k algorithms. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1389
Venue
PODS
Year
2006
Pagerank
0.00014256848
Overall Rank
1,072 | 92.56%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 25 of 25 citing papers.

Rank Citing Paper Year Venue Pagerank
302 BLINKS: Ranked Keyword Searches on Graphs 2007 SIGMOD 0.00028343691
1,202 SPARK: Top-k Keyword Query in Relational Databases 2007 SIGMOD 0.0001333126
1,435 Diversifying Top-K Results 2012 VLDB 0.00011981694
1,453 Keyword Proximity Search in Complex Data Graphs 2008 SIGMOD 0.00011921738
1,564 Keyword Search in Databases: The Power of RDBMS 2009 SIGMOD 0.00011340407
1,650 Efficient Enumeration of Maximal k-Plexes 2015 SIGMOD 0.00011002771
1,664 Structured Search Result Differentiation 2009 VLDB 0.0001096091
2,017 DB&IR: Both Sides Now (Extended Abstract) 2007 SIGMOD 9.7875061e-05
3,116 Learning to Create Data-Integrating Queries 2008 VLDB 7.5404022e-05
3,192 Gestural Query Specification 2014 VLDB 7.4085087e-05
3,456 Keyword Search on Structured and Semi-Structured Data 2009 SIGMOD 7.0756309e-05
4,178 Best Position Algorithms for Top-k Queries 2007 VLDB 6.3757762e-05
4,838 Finding Patterns in a Knowledge Base using Keywords to Compose Table Answers 2014 VLDB 5.883146e-05
5,041 The Complexity of Mining Maximal Frequent Subgraphs 2013 PODS 5.7356447e-05
5,331 Optimizing and Parallelizing Ranked Enumeration 2011 VLDB 5.5642069e-05
5,683 Effective Keyword-based Selection of Relational Databases 2007 SIGMOD 5.3733855e-05
5,697 Efficient and Progressive Group Steiner Tree Search 2016 SIGMOD 5.3672389e-05
7,313 Nearest Keyword Search in XML Documents 2011 SIGMOD 4.7599924e-05
8,030 Understanding Queries in a Search Database System 2010 PODS 4.5984458e-05
9,446 Finding a Minimal Tree Pattern Under Neighborhood Constraints 2011 PODS 4.3373542e-05
11,219 Efficient Approximation Framework for Attribute Recommendation 2023 SIGMOD 4.1905499e-05
11,324 Linear-Delay Enumeration for Minimal Steiner Problems 2022 PODS 4.1905499e-05
12,221 Transducing Markov Sequences 2010 PODS 4.1905499e-05
12,247 Exploratory Keyword Search on Data Graphs 2010 SIGMOD 4.1905499e-05
12,274 Ten Thousand SQLs: Parallel Keyword Queries Computing 2010 VLDB 4.1905499e-05
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.

Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
4,936 Efficient Algorithms for Answering the m-Closest Keywords Query 2015 SIGMOD 5.8150061e-05
2,774 Keyword Search in Graphs: Finding r-cliques 2011 VLDB 8.140768e-05
7,474 Optimizing Index for Taxonomy Keyword Search 2012 SIGMOD 4.7146619e-05
12,119 Optimal Top-k Generation of Attribute Combinations based on Ranked Lists 2012 SIGMOD 4.1905499e-05
7,313 Nearest Keyword Search in XML Documents 2011 SIGMOD 4.7599924e-05
7,610 A System for Keyword Proximity Search on XML Databases 2003 VLDB 4.6921191e-05
7,271 Exact Top-k Nearest Keyword Search in Large Networks 2015 SIGMOD 4.7764555e-05
8,504 Top-K Nearest Keyword Search on Large Graphs 2013 VLDB 4.491551e-05
186 Proximity Search in Databases 1998 VLDB 0.0003618341
1,453 Keyword Proximity Search in Complex Data Graphs 2008 SIGMOD 0.00011921738