TY - GEN
T1 - Preference queries over sets
AU - Zhang, Xi
AU - Chomicki, Jan
PY - 2011
Y1 - 2011
N2 - We propose a logic + SQL framework for set preferences. Candidate best sets are represented using profiles consisting of scalar features. This reduces set preferences to tuple preferences over set profiles. We propose two optimization techniques: superpreference and M-relation. Superpreference targets dominated profiles. It reduces the input size by filtering out tuples not belonging to any best k-subset. M-relation targets repeated profiles. It consolidates tuples that are exchangeable with regard to the given set preference, and therefore avoids redundant computation of the same profile. We show the results of an experimental study that demonstrates the efficacy of the optimizations.
AB - We propose a logic + SQL framework for set preferences. Candidate best sets are represented using profiles consisting of scalar features. This reduces set preferences to tuple preferences over set profiles. We propose two optimization techniques: superpreference and M-relation. Superpreference targets dominated profiles. It reduces the input size by filtering out tuples not belonging to any best k-subset. M-relation targets repeated profiles. It consolidates tuples that are exchangeable with regard to the given set preference, and therefore avoids redundant computation of the same profile. We show the results of an experimental study that demonstrates the efficacy of the optimizations.
UR - https://www.scopus.com/pages/publications/79957805343
U2 - 10.1109/ICDE.2011.5767866
DO - 10.1109/ICDE.2011.5767866
M3 - Conference contribution
AN - SCOPUS:79957805343
SN - 9781424489589
T3 - Proceedings - International Conference on Data Engineering
SP - 1019
EP - 1030
BT - 2011 IEEE 27th International Conference on Data Engineering, ICDE 2011
T2 - 2011 IEEE 27th International Conference on Data Engineering, ICDE 2011
Y2 - 11 April 2011 through 16 April 2011
ER -