Locating the "right'' piece of information among a wide range of available alternatives is not an easy task, as everyone has experienced at least once during his/her lifetime. In this paper we look at some recent issues arising when a database query is extended so as to include user preferences, which ultimately determine whether one alternative is reputed by the user better than another one. In particular, we focus on the case of qualitative preference queries, that strictly include well-known skyline queries, and describe how one can take advantage of the sorting machinery of standard database engines to speed-up evaluation both in centralized and distributed scenarios.
Processing Preference Queries in Standard Database Systems
CIACCIA, PAOLO
2006
Abstract
Locating the "right'' piece of information among a wide range of available alternatives is not an easy task, as everyone has experienced at least once during his/her lifetime. In this paper we look at some recent issues arising when a database query is extended so as to include user preferences, which ultimately determine whether one alternative is reputed by the user better than another one. In particular, we focus on the case of qualitative preference queries, that strictly include well-known skyline queries, and describe how one can take advantage of the sorting machinery of standard database engines to speed-up evaluation both in centralized and distributed scenarios.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
