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
- 1. Akrivi Vlachou (Athena; Norwegian Institute of Technology)
- 2. Christos Doulkeridis (Norwegian Institute of Technology; University of Piraeus)
- 3. Kjetil Nørvåg (Norwegian Institute of Technology)
- 4. Yannis Kotidis (Athens University of Economics and Business)
BibTeX Citation
@inproceedings{vlachou_sigmod13,
title = {{Branch-and-Bound Algorithm for Reverse Top-k Queries}},
author = {Vlachou, Akrivi and Doulkeridis, Christos and Nørvåg, Kjetil and Kotidis, Yannis},
series = {{SIGMOD} '13},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2463676.2465278},
url = {https://dl.acm.org/doi/10.1145/2463676.2465278},
year = {2013}
}
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,958 | Answering Why-not Questions on Reverse Top-k Queries | 2015 | VLDB | 7.80653e-05 |
| 5,359 | Why Not Yet: Fixing a Top-k Ranking that Is Not Fair to Individuals | 2023 | VLDB | 6.1608586e-05 |
| 5,916 | Reverse k-Ranks Query | 2014 | VLDB | 5.9472799e-05 |
| 6,382 | Maximum Rank Query | 2015 | VLDB | 5.805942e-05 |
| 6,972 | Global Immutable Region Computation | 2014 | SIGMOD | 5.6281923e-05 |
| 9,002 | Creating Top Ranking Options in the Continuous Option and Preference Space | 2019 | VLDB | 5.23944e-05 |
| 9,181 | Determining the Impact Regions of Competing Options in Preference Space | 2017 | SIGMOD | 5.2115802e-05 |
| 10,091 | On m-Impact Regions and Standing Top-k Influence Problems | 2021 | SIGMOD | 5.0806786e-05 |
| 11,880 | tau-LevelIndex: Towards Efficient Query Processing in Continuous Preference Space | 2022 | SIGMOD | 4.9769913e-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 |
|---|---|---|---|---|
| 1 | 643 | Evaluating Top-k Selection Queries | 1999 | VLDB |
| 2 | 2,561 | Answering Top-k Queries Using Views | 2006 | VLDB |
| 3 | 7,329 | Anytime Measures for Top-k Algorithms | 2007 | VLDB |
| 4 | 7,621 | Processing Top-k Join Queries | 2010 | VLDB |
| 5 | 7,396 | Efficient and Generic Evaluation of Ranked Queries | 2011 | SIGMOD |
| 6 | 8,458 | Efficient Top-K Processing Over Query-Dependent Functions | 2008 | VLDB |
| 7 | 12,605 | Optimal Top-k Generation of Attribute Combinations based on Ranked Lists | 2012 | SIGMOD |
| 8 | 2,485 | Processing a Large Number of Continuous Preference Top-k Queries | 2012 | SIGMOD |
| 9 | 4,548 | Identifying the Most Influential Data Objects with Reverse Top-k Queries | 2010 | VLDB |
| 10 | 5,916 | Reverse k-Ranks Query | 2014 | VLDB |