Representative Query Results by Voting
Rachel Behar, Sara Cohen
2022Year
2Citations
1Top-tier citations
Abstract
Traditional query answering returns all answers T to a given query. When T is large, the user may be interested in viewing only a smaller subset S of T. Previous work has focused on finding subsets S that are diverse, i.e., such that all items s,s' in S are very different one from another. This paper focuses on a complementary problem, namely finding subsets that are highly representative of the entire set of query results.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get fe491c00-1436-4f3f-a537-ace2bdf92372Cited by top-tier papers1
Ask how each one uses itRelated papers
- Query Refinement for Diversity Constraint SatisfactionJinyang Li, Yuval Moskovitch, Julia Stoyanovich, H. V. JagadishVLDB 2024 · 16 citations
- Understanding Queries by Conditional InstancesAmir Gilad, Zhengjie Miao, Sudeepa Roy, Jun YangSIGMOD 2022 · 9 citations
- What Does a Query Answer Tell You? Informativeness of Query Answers for Knowledge BasesLuca Andolfi, Gianluca Cima, Marco Console, Maurizio LenzeriniAAAI 2024 · 2 citations
- FEDEX: An Explainability Framework for Data Exploration StepsDaniel Deutch, Amir Gilad, Tova Milo, Amit Mualem et al.VLDB 2022 · 15 citations
- Being Happy with the Least: Achieving α-happiness with Minimum Number of TuplesMin Xie, Raymond Chi-Wing Wong, Peng Peng, Vassilis J. TsotrasICDE 2020 · 20 citations
