Database Paper Browser

Back to papers

Regret-Minimizing Representative Databases

Summary: Introduces k-regret queries that output k representative tuples for multi-criteria decision making without user-provided utility functions. Proves a maximum regret ratio bound independent of database size and offers linear-time algorithms compatible with skyline, validated on real and synthetic data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10155
Venue
VLDB
Year
2010
Pagerank
0.00014274615
Overall Rank
1,070 | 92.57%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 26 of 26 citing papers.

Rank Citing Paper Year Venue Pagerank
1,577 Designing Fair Ranking Schemes 2019 SIGMOD 0.00011276814
2,477 Computing k-Regret Minimizing Sets 2014 VLDB 8.6907684e-05
2,621 Interactive Regret Minimization 2012 SIGMOD 8.4408945e-05
5,113 Efficient Computation of Regret-ratio Minimizing Set: A Compact Maxima Representative 2017 SIGMOD 5.6827696e-05
5,259 Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality 2018 SIGMOD 5.5972902e-05
5,558 On Obtaining Stable Rankings 2019 VLDB 5.4375292e-05
5,906 k-Regret Queries with Nonlinear Utilities 2015 VLDB 5.274596e-05
6,378 Exact Processing of Uncertain Top-k Queries in Multi-criteria Settings 2018 VLDB 5.0844506e-05
6,381 k-Hit Query: Top-k Query with Probabilistic Utility Function 2015 SIGMOD 5.0839387e-05
6,804 RRR: Rank-Regret Representative 2019 SIGMOD 4.917138e-05
6,816 A Unified Optimization Algorithm For Solving "Regret-Minimizing Representative" Problems 2020 VLDB 4.9115662e-05
6,841 Minimizing Average Regret Ratio in Database 2016 SIGMOD 4.9057455e-05
6,913 FindYourFavorite: An Interactive System for Finding the User's Favorite Tuple in the Database 2019 SIGMOD 4.8878659e-05
6,988 Marrying Top-k with Skyline Queries: Relaxing the Preference Input while Producing Output of Controllable Size 2021 SIGMOD 4.8665394e-05
7,541 Strongly Truthful Interactive Regret Minimization 2019 SIGMOD 4.7104726e-05
8,712 Data Driven Approximation with Bounded Resources 2017 VLDB 4.4578168e-05
8,812 Creating Top Ranking Options in the Continuous Option and Preference Space 2019 VLDB 4.4397776e-05
9,253 Happiness Maximizing Sets under Group Fairness Constraints 2023 VLDB 4.3648789e-05
9,753 Minimum Coresets for Maxima Representation of Multidimensional Data 2021 PODS 4.2856385e-05
9,754 On m-Impact Regions and Standing Top-k Influence Problems 2021 SIGMOD 4.2856385e-05
9,755 Interactive Search for One of the Top-k 2021 SIGMOD 4.2856385e-05
10,223 On Fair Epsilon Net and Geometric Hitting Set 2026 VLDB 4.1905499e-05
10,989 Directional Queries: Making Top-k Queries More Effective in Discovering Relevant Results 2024 SIGMOD 4.1905499e-05
11,043 Robust Best Point Selection under Unreliable User Feedback 2024 VLDB 4.1905499e-05
11,197 rkHit: Representative Query with Uncertain Preference 2023 SIGMOD 4.1905499e-05
11,380 Interactive Mining with Ordered and Unordered Attributes 2022 VLDB 4.1905499e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 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