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 (Max Planck Institute of Computer Science)
- 2. Gerhard Weikum (Max Planck Institute of Computer Science)
- 3. Ralf Schenkel (Max Planck Institute of Computer Science)
BibTeX Citation
@article{theobald_vldb04,
title = {{Top-k Query Evaluation with Probabilistic Guarantees}},
author = {Theobald, Martin and Weikum, Gerhard and Schenkel, Ralf},
journal = {PVLDB},
series = {{VLDB} '04},
pages = {648--659},
doi = {10.1016/B978-012088469-8.50058-9},
url = {https://doi.org/10.1016/B978-012088469-8.50058-9},
year = {2004}
}
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 |
|---|---|---|---|---|
| 5 | Optimal Aggregation Algorithms for Middleware [Extended Abstract] | 2001 | PODS | 0.0010828372 |
| 108 | Optimizing Multi-Feature Queries for Image Databases | 2000 | VLDB | 0.00033228866 |
| 257 | The History of Histograms (abridged) | 2003 | VLDB | 0.00023154793 |
| 466 | Automated Ranking of Database Query Results | 2003 | CIDR | 0.00018014467 |
| 499 | Supporting Incremental Join Queries on Ranked Inputs | 2001 | VLDB | 0.00017431827 |
| 827 | Minimal Probing: Supporting Expensive Predicates for Top-k Queries | 2002 | SIGMOD | 0.00013769938 |
| 2,149 | Probabilistic Optimization of Top N Queries | 1999 | VLDB | 9.0821709e-05 |
| 2,948 | Optimized Query Execution in Large Search Engines with Global Page Ordering | 2003 | VLDB | 7.9323466e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,605 | Efficient Search for the Top-k Probable Nearest Neighbors in Uncertain Databases | 2008 | VLDB |
| 2 | 50 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB |
| 3 | 7,806 | Computing Immutable Regions for Subspace Top-k Queries | 2013 | VLDB |
| 4 | 3,049 | Top-k Queries on Uncertain Data: On Score Distribution and Typical Answers | 2009 | SIGMOD |
| 5 | 10,751 | Approximating Opaque Top-k Queries | 2025 | SIGMOD |
| 6 | 7,299 | Efficient and Generic Evaluation of Ranked Queries | 2011 | SIGMOD |
| 7 | 12,308 | Optimal Top-k Generation of Attribute Combinations based on Ranked Lists | 2012 | SIGMOD |
| 8 | 8,281 | Efficient Top-K Processing Over Query-Dependent Functions | 2008 | VLDB |
| 9 | 1,363 | Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach | 2008 | SIGMOD |
| 10 | 7,185 | Anytime Measures for Top-k Algorithms | 2007 | VLDB |