Preference queries over sets

Authors:
Xi Zhang;Jan Chomicki
Affiliations:
Department of Computer Science and Engineering, University at Buffalo, NY 14260, U.S.A.;Department of Computer Science and Engineering, University at Buffalo, NY 14260, U.S.A.
Venue:
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Year:
2011

Citing 0
Cited 7

A survey on representation, composition and application of preferences in database systems

ACM Transactions on Database Systems (TODS)
Evaluation of set-based queries with aggregation constraints

Proceedings of the 20th ACM international conference on Information and knowledge management
On skyline groups

Proceedings of the 21st ACM international conference on Information and knowledge management
Applications of ordinal ranks to flexible query answering

SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
IPS: an interactive package configuration system for trip planning

Proceedings of the VLDB Endowment
Skyline queries, front and back

ACM SIGMOD Record
Preference-based query answering in datalog+/- ontologies

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.