DBScholar

Back to papers

Regret-Minimizing Representative Databases

Summary: Introduces k-regret queries: selecting k tuples without eliciting utility functions, while minimizing worst-case regret relative to the full database. For linear utilities, proves database-size-independent bounds and gives practical linear-time, skyline-based algorithms. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
10345
Venue
VLDB
Year
2010
Pagerank
0.0001230281
Overall Rank
1,072 | 92.65%
DOI
10.14778/1920841.1920983

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{nanongkai_vldb10,
        title = {{Regret-Minimizing Representative Databases}},
        author = {Nanongkai, Danupon and Sarma, Atish Das and Lall, Ashwin and Lipton, Richard J. and Xu, Jun},
        journal = {PVLDB},
        series = {{VLDB} '10},
        volume = {3},
        number = {1},
        pages = {1114--1125},
        doi = {10.14778/1920841.1920983},
        url = {https://doi.org/10.14778/1920841.1920983},
        year = {2010}
}

Incoming Citations (Sorted by Pagerank)

Showing 26 of 26 citing papers.

Rank Citing Paper Year Venue Pagerank
1,597 Designing Fair Ranking Schemes 2019 SIGMOD 0.00010246472
2,063 Computing k-Regret Minimizing Sets 2014 VLDB 9.2399169e-05
2,491 Interactive Regret Minimization 2012 SIGMOD 8.5086491e-05
4,727 Efficient Computation of Regret-ratio Minimizing Set: A Compact Maxima Representative 2017 SIGMOD 6.5362946e-05
4,939 Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality 2018 SIGMOD 6.4336325e-05
5,465 On Obtaining Stable Rankings 2019 VLDB 6.2075408e-05
5,654 k-Regret Queries with Nonlinear Utilities 2015 VLDB 6.1330869e-05
5,944 k-Hit Query: Top-k Query with Probabilistic Utility Function 2015 SIGMOD 6.0328749e-05
6,052 Exact Processing of Uncertain Top-k Queries in Multi-criteria Settings 2018 VLDB 5.9941393e-05
6,592 RRR: Rank-Regret Representative 2019 SIGMOD 5.830041e-05
6,636 Marrying Top-k with Skyline Queries: Relaxing the Preference Input while Producing Output of Controllable Size 2021 SIGMOD 5.8172769e-05
6,786 A Unified Optimization Algorithm For Solving “Regret-Minimizing Representative” Problems 2020 VLDB 5.7740702e-05
6,886 Minimizing Average Regret Ratio in Database 2016 SIGMOD 5.7460174e-05
7,305 Strongly Truthful Interactive Regret Minimization 2019 SIGMOD 5.6501646e-05
7,512 FindYourFavorite: An Interactive System for Finding the User's Favorite Tuple in the Database 2019 SIGMOD 5.6029996e-05
8,701 Data Driven Approximation with Bounded Resources 2017 VLDB 5.3828806e-05
8,825 Creating Top Ranking Options in the Continuous Option and Preference Space 2019 VLDB 5.3616725e-05
9,393 Happiness Maximizing Sets under Group Fairness Constraints 2023 VLDB 5.2755515e-05
9,899 Minimum Coresets for Maxima Representation of Multidimensional Data 2021 PODS 5.1997534e-05
9,900 On m-Impact Regions and Standing Top-k Influence Problems 2021 SIGMOD 5.1997534e-05
9,901 Interactive Search for One of the Top-k 2021 SIGMOD 5.1997534e-05
10,511 On Fair Epsilon Net and Geometric Hitting Set 2026 VLDB 5.093636e-05
11,199 Directional Queries: Making Top-k Queries More Effective in Discovering Relevant Results 2024 SIGMOD 5.093636e-05
11,250 Robust Best Point Selection under Unreliable User Feedback 2024 VLDB 5.093636e-05
11,397 rkHit: Representative Query with Uncertain Preference 2023 SIGMOD 5.093636e-05
11,576 Interactive Mining with Ordered and Unordered Attributes 2022 VLDB 5.093636e-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