We consider the problem of sufficiently answer preference queries when access to the database is through a set of ranked lists and preferences define a strict partial order over the database objects. The iMPO-1 algorithm we introduce minimizes the number of database accesses and can also incrementally return objects as soon as they are guaranteed to be part of the result. As such it generalizes known techniques developed for specific cases, such as Skyline queries
Optimal Incremental Evaluation of Preference Queries Based on Ranked Sub-queries
BARTOLINI, ILARIA;CIACCIA, PAOLO
2005
Abstract
We consider the problem of sufficiently answer preference queries when access to the database is through a set of ranked lists and preferences define a strict partial order over the database objects. The iMPO-1 algorithm we introduce minimizes the number of database accesses and can also incrementally return objects as soon as they are guaranteed to be part of the result. As such it generalizes known techniques developed for specific cases, such as Skyline queriesFile in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
