Premium
On database queries involving competitive conditional preferences
Author(s) -
Bosc P.,
Hadjali A.,
Pivert O.
Publication year - 2011
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/int.20463
Subject(s) - computer science , preference , competition (biology) , tree (set theory) , information retrieval , type (biology) , database , mathematics , combinatorics , statistics , ecology , biology
This paper introduces a new type of database queries involving preferences. The idea is to consider competitive conditional preference clauses structured as a tree, of the type “preferably P 1 or ⋅⋅⋅ or P n ; if P 1 then preferably P 1,1 or …; if P 2 then preferably P 2,1 or …,” where the P i s are not exclusive (thus the notion of competition). The paper defines two possible interpretations of such queries and outlines two evaluation techniques which follow from them. © 2010 Wiley Periodicals, Inc.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom