On Finding the Maxima of a Set of Vectors
Journal of the ACM (JACM)
Querying with Intrinsic Preferences
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Efficient Progressive Skyline Computation
Proceedings of the 27th International Conference on Very Large Data Bases
An optimal and progressive algorithm for skyline queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Maximal vector computation in large data sets
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Finding k-dominant skylines in high dimensional space
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Exploiting Indifference for Customization of Partial Order Skylines
IDEAS '06 Proceedings of the 10th International Database Engineering and Applications Symposium
Shooting stars in the sky: an online algorithm for skyline queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Foundations of preferences in database systems
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Eliciting matters: controlling skyline sizes by incremental integration of user preferences
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
An efficient skyline framework for matchmaking applications
Journal of Network and Computer Applications
Preference elicitation in prioritized skyline queries
The VLDB Journal — The International Journal on Very Large Data Bases
Preferences in AI: An overview
Artificial Intelligence
Database preference queries--a possibilistic logic approach with symbolic priorities
Annals of Mathematics and Artificial Intelligence
Information Sciences: an International Journal
Hi-index | 0.00 |
When issuing user-specific queries, users often have a vaguely defined information need. Skyline queries identify the most "interesting" objects for users' incomplete preferences, which provides users with intuitive query formulation mechanism. However, the applicability of this intuitive query paradigm suffers from a severe drawback. Incomplete preferences on domain values can often lead to impractical skyline result sizes. In particular, this challenge is more critical over categorical domains. This paper addresses this challenge by developing an iterative elicitation framework. While user preferences are collected at each iteration, the framework aims to both minimize user interaction and maximize skyline reduction. The framework allows to identify a reasonably small and focused skyline set, while keeping the query formulation still intuitive for users. All that is needed is answering a few well-chosen questions. We perform extensive experiments to validate the benefits of our strategy and prove that a few questions are enough to acquire a desired manageable skyline set.