Preference structures and their numerical representations
Theoretical Computer Science
A framework for expressing and combining preferences
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Top-k selection queries over relational databases: Mapping strategies and performance evaluation
ACM Transactions on Database Systems (TODS)
Proceedings of the 17th International Conference on Data Engineering
Preference formulas in relational queries
ACM Transactions on Database Systems (TODS)
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
Preference SQL: design, implementation, experiences
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient sort-based skyline evaluation
ACM Transactions on Database Systems (TODS)
Kendall’s correlation coefficient for vague preferences
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Database preferences queries: a possibilistic logic approach with symbolic priorities
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
On different types of fuzzy skylines
ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
SQLf: a relational database language for fuzzy querying
IEEE Transactions on Fuzzy Systems
Hi-index | 0.00 |
In this paper, we define an approach to database preference queries based on the fusion of local orders. The situation considered is that of queries involving incommensurable partial preferences, possibly associated with scoring functions. The basic principle is to rank the tuples according to each partial preference, then to merge the local orders obtained, using a linear function for aggregating the local scores attached to the tuples. Basically, a local score expresses the extent to which a tuple is strictly better than many others and not strictly worse than many others with respect to the partial preference attached to a given attribute. This model refines Pareto order for queries of the Skyline type.