<Previous Article In Issue
Volume 5, Issue 4, August 2012, Pages 789 - 804
An Approach to Database Preference Queries Based on an Outranking Relation
Authors
Patrick Bosc, Olivier Pivert, Grégory Smits
Corresponding Author
Patrick Bosc
Received 9 July 2012, Accepted 18 July 2012, Available Online 1 August 2012.
- DOI
- 10.1080/18756891.2012.718161How to use a DOI?
- Keywords
- Databases, preference queries, outranking
- Abstract
In this paper, we describe an approach to database preference queries based on the notion of outranking, suited to the situation where preferences on different attributes are not commensurable. This model constitutes an alternative to the use of Pareto order whose main drawback is to leave many tuples incomparable in general. Even though outranking does not define an order in the mathematical sense of the term, we describe a technique which yields a complete pre-order, based on a global aggregation of the outranking degrees computed for each pair of tuples, which reflects the global “quality” of a tuple w.r.t. the others.
- Copyright
- © 2017, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
<Previous Article In Issue
Cite this article
TY - JOUR AU - Patrick Bosc AU - Olivier Pivert AU - Grégory Smits PY - 2012 DA - 2012/08/01 TI - An Approach to Database Preference Queries Based on an Outranking Relation JO - International Journal of Computational Intelligence Systems SP - 789 EP - 804 VL - 5 IS - 4 SN - 1875-6883 UR - https://doi.org/10.1080/18756891.2012.718161 DO - 10.1080/18756891.2012.718161 ID - Bosc2012 ER -