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
hc82affef8dd14a79
Venue
VLDB
Year
2010
Pagerank
0.00012092041
Overall Rank
1,087 | 92.70%
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,379 Designing Fair Ranking Schemes 2019 SIGMOD 0.00010859038
2,106 Computing k-Regret Minimizing Sets 2014 VLDB 9.0287481e-05
2,545 Interactive Regret Minimization 2012 SIGMOD 8.3139128e-05
4,833 Efficient Computation of Regret-ratio Minimizing Set: A Compact Maxima Representative 2017 SIGMOD 6.3867086e-05
5,071 Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality 2018 SIGMOD 6.2863925e-05
5,611 On Obtaining Stable Rankings 2019 VLDB 6.0657421e-05
5,788 k-Regret Queries with Nonlinear Utilities 2015 VLDB 5.9926479e-05
6,066 k-Hit Query: Top-k Query with Probabilistic Utility Function 2015 SIGMOD 5.8950525e-05
6,178 Exact Processing of Uncertain Top-k Queries in Multi-criteria Settings 2018 VLDB 5.8581814e-05
6,721 RRR: Rank-Regret Representative 2019 SIGMOD 5.6966108e-05
6,761 Marrying Top-k with Skyline Queries: Relaxing the Preference Input while Producing Output of Controllable Size 2021 SIGMOD 5.6873442e-05
6,920 A Unified Optimization Algorithm For Solving “Regret-Minimizing Representative” Problems 2020 VLDB 5.6418435e-05
7,034 Minimizing Average Regret Ratio in Database 2016 SIGMOD 5.614437e-05
7,456 Strongly Truthful Interactive Regret Minimization 2019 SIGMOD 5.5209079e-05
7,664 FindYourFavorite: An Interactive System for Finding the User's Favorite Tuple in the Database 2019 SIGMOD 5.4746904e-05
8,851 Data Driven Approximation with Bounded Resources 2017 VLDB 5.2634608e-05
9,002 Creating Top Ranking Options in the Continuous Option and Preference Space 2019 VLDB 5.23944e-05
9,584 Happiness Maximizing Sets under Group Fairness Constraints 2023 VLDB 5.154741e-05
10,090 Minimum Coresets for Maxima Representation of Multidimensional Data 2021 PODS 5.0806786e-05
10,091 On m-Impact Regions and Standing Top-k Influence Problems 2021 SIGMOD 5.0806786e-05
10,092 Interactive Search for One of the Top-k 2021 SIGMOD 5.0806786e-05
10,706 On Fair Epsilon Net and Geometric Hitting Set 2026 VLDB 4.9769913e-05
11,547 Directional Queries: Making Top-k Queries More Effective in Discovering Relevant Results 2024 SIGMOD 4.9769913e-05
11,588 Robust Best Point Selection under Unreliable User Feedback 2024 VLDB 4.9769913e-05
11,718 rkHit: Representative Query with Uncertain Preference 2023 SIGMOD 4.9769913e-05
11,890 Interactive Mining with Ordered and Unordered Attributes 2022 VLDB 4.9769913e-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