Top-k Query Evaluation with Probabilistic Guarantees
Summary: Proposes approximate top-k algorithms using probabilistic bounds to prune candidates during index-list scans, reducing reliance on Fagin’s TA. Convolution-based bounds yield high-probability guarantees for early dropping, with experiments on Web and structured data. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Martin Theobald
- 2. Gerhard Weikum
- 3. Ralf Schenkel
Incoming Citations (Sorted by Pagerank)
Showing 25 of 25 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7 | Optimal Aggregation Algorithms for Middleware [Extended Abstract] | 2001 | PODS | 0.0015496097 |
| 17 | Optimizing Multi-Feature Queries for Image Databases | 2000 | VLDB | 0.00096067547 |
| 325 | The History of Histograms (abridged) | 2003 | VLDB | 0.00027378328 |
| 427 | Automated Ranking of Database Query Results | 2003 | CIDR | 0.0002352637 |
| 552 | Supporting Incremental Join Queries on Ranked Inputs | 2001 | VLDB | 0.00020310903 |
| 1,096 | Minimal Probing: Supporting Expensive Predicates for Top-k Queries | 2002 | SIGMOD | 0.00014120512 |
| 2,556 | Probabilistic Optimization of Top N Queries | 1999 | VLDB | 8.5465733e-05 |
| 3,091 | Optimized Query Execution in Large Search Engines with Global Page Ordering | 2003 | VLDB | 7.5805947e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,542 | Efficient Search for the Top-k Probable Nearest Neighbors in Uncertain Databases | 2008 | VLDB | 0.00011456321 |
| 74 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB | 0.00057857292 |
| 7,750 | Computing Immutable Regions for Subspace Top-k Queries | 2013 | VLDB | 4.6607023e-05 |
| 3,185 | Top-k Queries on Uncertain Data: On Score Distribution and Typical Answers | 2009 | SIGMOD | 7.4192604e-05 |
| 10,471 | Approximating Opaque Top-k Queries | 2025 | SIGMOD | 4.1945683e-05 |
| 7,276 | Efficient and Generic Evaluation of Ranked Queries | 2011 | SIGMOD | 4.7798595e-05 |
| 12,111 | Optimal Top-k Generation of Attribute Combinations based on Ranked Lists | 2012 | SIGMOD | 4.1945683e-05 |
| 7,963 | Efficient Top-K Processing Over Query-Dependent Functions | 2008 | VLDB | 4.613363e-05 |
| 1,707 | Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach | 2008 | SIGMOD | 0.00010816111 |
| 7,135 | Anytime Measures for Top-k Algorithms | 2007 | VLDB | 4.8221884e-05 |