Computing k-Regret Minimizing Sets

Summary: Proposes k-regret minimizing sets as a relaxed data-summary: small R approximates D's top-k results via top-1 queries. In 2D, optimal R via DP plane-sweep; in higher dimensions, a greedy LP-based algorithm yields compact summaries despite NP-hardness. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 10917
Venue: VLDB
Year: 2014
Pagerank: 8.6927744e-05
Overall Rank: 2,478 | 82.77%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 16 of 16 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
5,116	Efficient Computation of Regret-ratio Minimizing Set: A Compact Maxima Representative	2017	SIGMOD	5.6830089e-05
5,255	Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality	2018	SIGMOD	5.6013035e-05
5,555	On Obtaining Stable Rankings	2019	VLDB	5.4386174e-05
5,904	k-Regret Queries with Nonlinear Utilities	2015	VLDB	5.2790141e-05
6,387	Exact Processing of Uncertain Top-k Queries in Multi-criteria Settings	2018	VLDB	5.0851965e-05
6,816	RRR: Rank-Regret Representative	2019	SIGMOD	4.9173197e-05
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
8,584	Geometric Approaches for Top-k Queries	2017	VLDB	4.4914121e-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,775	Interactive Search for One of the Top-k	2021	SIGMOD	4.2856106e-05
10,555	Mining the Minoria: Unknown, Under-represented, and Under-performing Minority Groups	2025	VLDB	4.1945683e-05
10,986	Directional Queries: Making Top-k Queries More Effective in Discovering Relevant Results	2024	SIGMOD	4.1945683e-05
11,040	Robust Best Point Selection under Unreliable User Feedback	2024	VLDB	4.1945683e-05
11,195	rkHit: Representative Query with Uncertain Preference	2023	SIGMOD	4.1945683e-05

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 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
2,615	Interactive Regret Minimization	2012	SIGMOD	8.4473503e-05
3,665	Ad-hoc Top-k Query Answering for Data Streams	2007	VLDB	6.8633354e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
6,080	Answering Top-k Representative Queries on Graph Databases	2014	SIGMOD	5.2214553e-05
11,195	rkHit: Representative Query with Uncertain Preference	2023	SIGMOD	4.1945683e-05
5,904	k-Regret Queries with Nonlinear Utilities	2015	VLDB	5.2790141e-05
6,816	RRR: Rank-Regret Representative	2019	SIGMOD	4.9173197e-05
6,843	Minimizing Average Regret Ratio in Database	2016	SIGMOD	4.909799e-05
9,772	Minimum Coresets for Maxima Representation of Multidimensional Data	2021	PODS	4.2856106e-05
1,072	Regret-Minimizing Representative Databases	2010	VLDB	0.00014270817
5,255	Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality	2018	SIGMOD	5.6013035e-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