rkHit: Representative Query with Uncertain Preference
Summary: Proposes rkHit, selecting r representative tuples under a distribution over scoring functions to maximize the probability a chosen tuple is attractive in top-k (expected user satisfaction). In 2D, 2DH gives an exact polynomial algorithm; rkHit is NP-hard for d≥3; 3D offers a (1−1/e)-approximation 3DH under uniform preferences while MDH handles any dimension/distribution via sampling+clustering; experiments show efficiency. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Xingxing Xiao (Harbin Engineering University; Shenzhen University)
- 2. Jianzhong Li (Shenzhen University)
BibTeX Citation
@inproceedings{xiao_sigmod23,
title = {{rkHit: Representative Query with Uncertain Preference}},
author = {Xiao, Xingxing and Li, Jianzhong},
series = {{SIGMOD} '23},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3589271},
url = {https://dl.acm.org/doi/10.1145/3589271},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Outgoing Citations (Sorted by Pagerank)
Showing 23 of 23 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,105 | Top-k Queries on Uncertain Data: On Score Distribution and Typical Answers | 2009 | SIGMOD |
| 2 | 6,918 | A Unified Optimization Algorithm For Solving “Regret-Minimizing Representative” Problems | 2020 | VLDB |
| 3 | 2,105 | Computing k-Regret Minimizing Sets | 2014 | VLDB |
| 4 | 9,187 | Finding Diverse, High-Value Representatives on a Surface of Answers | 2017 | VLDB |
| 5 | 9,172 | Determining the Impact Regions of Competing Options in Preference Space | 2017 | SIGMOD |
| 6 | 13,797 | Supporting Hard Queries over Probabilistic Preferences | 2020 | VLDB |
| 7 | 10,087 | Interactive Search for One of the Top-k | 2021 | SIGMOD |
| 8 | 11,100 | A Rank-Based Approach to Recommender System’s Top-K Queries with Uncertain Scores | 2025 | SIGMOD |
| 9 | 6,065 | k-Hit Query: Top-k Query with Probabilistic Utility Function | 2015 | SIGMOD |
| 10 | 6,176 | Exact Processing of Uncertain Top-k Queries in Multi-criteria Settings | 2018 | VLDB |