Approximating Opaque Top-k Queries
Summary: Approximates opaque top-k queries with a task-agnostic hierarchical index and a bandit. Histogram-based modeling targets fat tails and yields a constant-factor approximation, with up to 10× speedups over exhaustive scan. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Jiwon Chang
- 2. Fatemeh Nargesian
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 17 of 17 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 |
|---|---|---|---|---|
| 3,807 | Supporting Ad-hoc Ranking Aggregates | 2006 | SIGMOD | 6.747576e-05 |
| 11,217 | Efficient Approximation Framework for Attribute Recommendation | 2023 | SIGMOD | 4.1945683e-05 |
| 6,080 | Answering Top-k Representative Queries on Graph Databases | 2014 | SIGMOD | 5.2214553e-05 |
| 3,463 | Towards Robust Indexing for Ranked Queries | 2006 | VLDB | 7.069675e-05 |
| 7,276 | Efficient and Generic Evaluation of Ranked Queries | 2011 | SIGMOD | 4.7798595e-05 |
| 3,185 | Top-k Queries on Uncertain Data: On Score Distribution and Typical Answers | 2009 | SIGMOD | 7.4192604e-05 |
| 6,387 | Exact Processing of Uncertain Top-k Queries in Multi-criteria Settings | 2018 | VLDB | 5.0851965e-05 |
| 12,135 | Answering Top-k Queries Over a Mixture of Attractive and Repulsive Dimensions | 2012 | VLDB | 4.1945683e-05 |
| 7,963 | Efficient Top-K Processing Over Query-Dependent Functions | 2008 | VLDB | 4.613363e-05 |
| 1,808 | Top-k Query Evaluation with Probabilistic Guarantees | 2004 | VLDB | 0.00010486213 |