When faced with a database containing millions of tuples, an end user might be only interested in finding his/her favorite tuple in the database. In this paper, we study how to help an end user to find such a favorite tuple with a few user interactions. In each interaction, a user is presented with a small number of tuples (which can be artificial tuples outside the database or true tuples inside the database) and s/he is asked to indicate the tuple s/he favors the most among them. Different from the previous work which displays artificial tuples to users during the interaction and requires heavy user interactions, we achieve a stronger result. Specifically, we use a concept, called the utility hyperplane, to model the user preference and an effective pruning strategy to locate the favorite tuple for a user in the whole database. Based on these techniques, we developed an interactive system, called FindYourFavorite, and demonstrate that the system could identify the favorite tuple for a user with a few user interactions by always displaying true tuples in the database.
[1]
Richard J. Lipton,et al.
Regret-minimizing representative databases
,
2010,
Proc. VLDB Endow..
[2]
Bernhard Seeger,et al.
Progressive skyline computation in database systems
,
2005,
TODS.
[3]
Kazuhisa Makino,et al.
Interactive regret minimization
,
2012,
SIGMOD Conference.
[4]
Raymond Chi-Wing Wong,et al.
Strongly Truthful Interactive Regret Minimization
,
2019,
SIGMOD Conference.
[5]
Micha Sharir,et al.
A Combinatorial Bound for Linear Programming and Related Problems
,
1992,
STACS.