Probabilistic Optimization of Top N Queries
Summary: Introduces probabilistic optimization for Top-N queries by selecting aggressive predicates that prune low-ranked results while modeling the probability and cost of insufficient answers and execution restarts. Experiments show lower average runtime for modest optimization overhead. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Donko Donjerkovic (University of Wisconsin)
- 2. Raghu Ramakrishnan (University of Wisconsin)
BibTeX Citation
@article{donjerkovic_vldb99,
title = {{Probabilistic Optimization of Top N Queries}},
author = {Donjerkovic, Donko and Ramakrishnan, Raghu},
journal = {PVLDB},
series = {{VLDB} '99},
year = {1999}
}
Incoming Citations (Sorted by Pagerank)
Showing 20 of 20 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 434 | Query Optimization for Parallel Execution | 1992 | SIGMOD |
| 2 | 566 | Towards a Robust Query Optimizer: A Principled and Practical Approach | 2005 | SIGMOD |
| 3 | 6,389 | Query Refinement for Diverse Top-k Selection | 2024 | SIGMOD |
| 4 | 9,044 | Threshold Query Optimization for Uncertain Data | 2010 | SIGMOD |
| 5 | 12,308 | Optimal Top-k Generation of Attribute Combinations based on Ranked Lists | 2012 | SIGMOD |
| 6 | 1,844 | Probabilistic Ranking of Database Query Results | 2004 | VLDB |
| 7 | 635 | Evaluating Top-k Selection Queries | 1999 | VLDB |
| 8 | 3,698 | Optimizing MPF Queries: Decision Support and Probabilistic Inference | 2007 | SIGMOD |
| 9 | 7,711 | Optimizing Probabilistic Query Processing on Continuous Uncertain Data | 2011 | VLDB |
| 10 | 50 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB |