Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality
Summary: Lower bound on the maximum regret ratio for k-regret queries; Sphere, a restriction-free algorithm that works in arbitrary dimensionality. Asymptotically optimal upper bound on regret, outperforming state-of-the-art methods in extensive experiments. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Min Xie
- 2. Raymond Chi-Wing Wong
- 3. Jian Li
- 4. Cheng Long
- 5. Ashwin Lall
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,834 | A Unified Optimization Algorithm For Solving "Regret-Minimizing Representative" Problems | 2020 | VLDB | 4.9117328e-05 |
| 7,002 | Marrying Top-k with Skyline Queries: Relaxing the Preference Input while Producing Output of Controllable Size | 2021 | SIGMOD | 4.8670742e-05 |
| 7,559 | Strongly Truthful Interactive Regret Minimization | 2019 | SIGMOD | 4.7107487e-05 |
| 8,877 | Creating Top Ranking Options in the Continuous Option and Preference Space | 2019 | VLDB | 4.4302563e-05 |
| 9,246 | Happiness Maximizing Sets under Group Fairness Constraints | 2023 | VLDB | 4.3690661e-05 |
| 9,772 | Minimum Coresets for Maxima Representation of Multidimensional Data | 2021 | PODS | 4.2856106e-05 |
| 9,774 | On m-Impact Regions and Standing Top-k Influence Problems | 2021 | SIGMOD | 4.2856106e-05 |
| 9,775 | Interactive Search for One of the Top-k | 2021 | SIGMOD | 4.2856106e-05 |
| 11,378 | Interactive Mining with Ordered and Unordered Attributes | 2022 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 430 | The Onion Technique: Indexing for Linear Optimization Queries | 2000 | SIGMOD | 0.00023463938 |
| 914 | Finding k-Dominant Skylines in High Dimensional Space | 2006 | SIGMOD | 0.00015387584 |
| 1,072 | Regret-Minimizing Representative Databases | 2010 | VLDB | 0.00014270817 |
| 1,445 | Diversifying Top-K Results | 2012 | VLDB | 0.00011945231 |
| 1,998 | Discovering Relative Importance of Skyline Attributes | 2009 | VLDB | 9.824482e-05 |
| 2,478 | Computing k-Regret Minimizing Sets | 2014 | VLDB | 8.6927744e-05 |
| 2,480 | Top-k Bounded Diversification | 2012 | SIGMOD | 8.6899714e-05 |
| 2,615 | Interactive Regret Minimization | 2012 | SIGMOD | 8.4473503e-05 |
| 5,116 | Efficient Computation of Regret-ratio Minimizing Set: A Compact Maxima Representative | 2017 | SIGMOD | 5.6830089e-05 |
| 5,904 | k-Regret Queries with Nonlinear Utilities | 2015 | VLDB | 5.2790141e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,366 | Efficient Processing of Top-k Dominating Queries on Multi-Dimensional Data | 2007 | VLDB | 8.9523637e-05 |
| 7,559 | Strongly Truthful Interactive Regret Minimization | 2019 | SIGMOD | 4.7107487e-05 |
| 6,391 | k-Hit Query: Top-k Query with Probabilistic Utility Function | 2015 | SIGMOD | 5.0842079e-05 |
| 2,478 | Computing k-Regret Minimizing Sets | 2014 | VLDB | 8.6927744e-05 |
| 6,834 | A Unified Optimization Algorithm For Solving "Regret-Minimizing Representative" Problems | 2020 | VLDB | 4.9117328e-05 |
| 5,116 | Efficient Computation of Regret-ratio Minimizing Set: A Compact Maxima Representative | 2017 | SIGMOD | 5.6830089e-05 |
| 2,615 | Interactive Regret Minimization | 2012 | SIGMOD | 8.4473503e-05 |
| 5,904 | k-Regret Queries with Nonlinear Utilities | 2015 | VLDB | 5.2790141e-05 |
| 6,843 | Minimizing Average Regret Ratio in Database | 2016 | SIGMOD | 4.909799e-05 |
| 1,072 | Regret-Minimizing Representative Databases | 2010 | VLDB | 0.00014270817 |