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)
Incoming Non-self Citations Over Time
Authors
- 1. Benny Kimelfeld (Hebrew University)
- 2. Yehoshua Sagiv (Hebrew University)
BibTeX Citation
@inproceedings{kimelfeld_pods06,
address = {New York, NY, USA},
series = {{PODS} '06},
title = {{Finding and Approximating Top-k Answers in Keyword Proximity Search}},
url = {https://dl.acm.org/doi/10.1145/1142351.1142377},
doi = {10.1145/1142351.1142377},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Kimelfeld, Benny and Sagiv, Yehoshua},
year = {2006}
}
Incoming Citations (Sorted by Pagerank)
Showing 25 of 25 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 |
|---|---|---|---|---|
| 5 | Optimal Aggregation Algorithms for Middleware [Extended Abstract] | 2001 | PODS | 0.0010828372 |
| 37 | DISCOVER: Keyword Search in Relational Databases | 2002 | VLDB | 0.00048017193 |
| 302 | Bidirectional Expansion For Keyword Search on Graph Databases | 2005 | VLDB | 0.00021963347 |
| 1,898 | DBXplorer: Enabling Keyword Search over Relational Databases | 2002 | SIGMOD | 9.5240947e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,715 | Efficient Algorithms for Answering the m-Closest Keywords Query | 2015 | SIGMOD |
| 2 | 2,691 | Keyword Search in Graphs: Finding r-cliques | 2011 | VLDB |
| 3 | 7,896 | Optimizing Index for Taxonomy Keyword Search | 2012 | SIGMOD |
| 4 | 12,308 | Optimal Top-k Generation of Attribute Combinations based on Ranked Lists | 2012 | SIGMOD |
| 5 | 7,180 | Nearest Keyword Search in XML Documents | 2011 | SIGMOD |
| 6 | 7,773 | A System for Keyword Proximity Search on XML Databases | 2003 | VLDB |
| 7 | 6,940 | Exact Top-k Nearest Keyword Search in Large Networks | 2015 | SIGMOD |
| 8 | 8,493 | Top-K Nearest Keyword Search on Large Graphs | 2013 | VLDB |
| 9 | 301 | Proximity Search in Databases | 1998 | VLDB |
| 10 | 1,542 | Keyword Proximity Search in Complex Data Graphs | 2008 | SIGMOD |