On a preference query language that handles symbolic scores

Authors:
Olivier Pivert;Grégory Smits
Affiliations:
Irisa --- University of Rennes 1, Technopole Anticipa, Lannion Cedex, France;Irisa --- University of Rennes 1, Technopole Anticipa, Lannion Cedex, France
Venue:
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
Year:
2012

Citing 11
Cited 0

Weighted minimum and maximun operations in fuzzy sets theory

Information Sciences: an International Journal
Fuzzy queries in multimedia database systems

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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)
The Skyline Operator

Proceedings of the 17th International Conference on Data Engineering
Evaluating Top-k Selection Queries

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Preference formulas in relational queries

ACM Transactions on Database Systems (TODS)
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
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
SQLf: a relational database language for fuzzy querying

IEEE Transactions on Fuzzy Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a preference query language based on SQL, which captures preferences modeled by means of symbolic scores expressed in a linguistic manner. The high expressivity of this language is emphasized, and it is shown that some connections between the preference criteria considered and Boolean conditions make it possible to take advantage of the optimization mechanisms offered by classical DBMSs when it comes to query processing.