论文信息 - Profiling Sets for Preference Querying

Profiling Sets for Preference Querying

We propose a logical framework for set preferences. Candidate sets are represented using profiles consisting of scalar features. This reduces set preferences to tuple preferences over set profiles. We also give a heuristic algorithm for the computation of the “best” sets.

Xi Zhang | Jan Chomicki

[1] Jan Chomicki,et al. Preference formulas in relational queries , 2003, TODS.

[2] Dimitrios Gunopulos,et al. Efficient Approximation Of Optimization Queries Under Parametric Aggregation Constraints , 2003, VLDB.

[3] Werner Kießling,et al. Preference SQL - Design, Implementation, Experiences , 2002, VLDB.

[4] Werner Kießling,et al. Foundations of Preferences in Database Systems , 2002, VLDB.

[5] Jan Chomicki,et al. Semantic optimization techniques for preference queries , 2005, Inf. Syst..

[6] Marie desJardins,et al. DD-PREF: A Language for Expressing Preferences over Sets , 2005, AAAI.

[7] Ronen I. Brafman,et al. On Graphical Modeling of Preference and Importance , 2011, J. Artif. Intell. Res..

[8] Ronen I. Brafman,et al. Computing Optimal Subsets , 2007, AAAI.

[9] Craig Boutilier,et al. CP-nets: a tool for represent-ing and reasoning with conditional ceteris paribus state-ments , 2004 .

[10] Donald Kossmann,et al. The Skyline operator , 2001, Proceedings 17th International Conference on Data Engineering.