Branch-and-Bound Algorithm for Reverse Top-k Queries
Summary: Proposes a branch-and-bound algorithm for reverse top-k queries that avoids per-user top-k executions and full preference scans. Leverages pruning properties and optimizations; experiments show large gains over RTA on large preference collections. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,100 | Answering Why-not Questions on Reverse Top-k Queries | 2015 | VLDB | 7.5625111e-05 |
| 5,839 | Why Not Yet: Fixing a Top-k Ranking that Is Not Fair to Individuals | 2023 | VLDB | 5.3073497e-05 |
| 6,204 | Maximum Rank Query | 2015 | VLDB | 5.1547199e-05 |
| 6,219 | Reverse k-Ranks Query | 2014 | VLDB | 5.1458862e-05 |
| 6,632 | Global Immutable Region Computation | 2014 | SIGMOD | 4.9803909e-05 |
| 8,812 | Creating Top Ranking Options in the Continuous Option and Preference Space | 2019 | VLDB | 4.4397776e-05 |
| 8,823 | Determining the Impact Regions of Competing Options in Preference Space | 2017 | SIGMOD | 4.4372904e-05 |
| 9,754 | On m-Impact Regions and Standing Top-k Influence Problems | 2021 | SIGMOD | 4.2856385e-05 |
| 11,369 | tau-LevelIndex: Towards Efficient Query Processing in Continuous Preference Space | 2022 | SIGMOD | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 14 of 14 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 |
|---|---|---|---|---|
| 802 | Evaluating Top-k Selection Queries | 1999 | VLDB | 0.00016440813 |
| 2,936 | Answering Top-k Queries Using Views | 2006 | VLDB | 7.8579393e-05 |
| 7,133 | Anytime Measures for Top-k Algorithms | 2007 | VLDB | 4.8175888e-05 |
| 7,660 | Processing Top-k Join Queries | 2010 | VLDB | 4.6814547e-05 |
| 7,273 | Efficient and Generic Evaluation of Ranked Queries | 2011 | SIGMOD | 4.775366e-05 |
| 7,966 | Efficient Top-K Processing Over Query-Dependent Functions | 2008 | VLDB | 4.6089395e-05 |
| 12,119 | Optimal Top-k Generation of Attribute Combinations based on Ranked Lists | 2012 | SIGMOD | 4.1905499e-05 |
| 2,967 | Processing a Large Number of Continuous Preference Top-k Queries | 2012 | SIGMOD | 7.7975455e-05 |
| 5,024 | Identifying the Most Influential Data Objects with Reverse Top-k Queries | 2010 | VLDB | 5.747078e-05 |
| 6,219 | Reverse k-Ranks Query | 2014 | VLDB | 5.1458862e-05 |