2015 | OriginalPaper | Buchkapitel
Skyband-Set for Answering Top-k Set Queries of Any Users
Autoren: Md. Anisuzzaman Siddique, Asif Zaman, Yasuhiko Morimoto
Verlag: Springer International Publishing
Skyline computation fails to response variant queries that need to analyze not just individual object of a dataset but also their combinations. Therefore set skyline has attracted considerable research attention in the past few years. In this paper, we propose a novel variant of set skyline query called the “skyband-set” query. We consider a problem to select representative distinctive objectsets in a numerical database. Let
s
be the number of objects in each set and
n
be the total number of objects in the database. The number of objectsets in the database amounts to
n
C
s
. We propose an efficient algorithm to compute skyband-set of the
n
C
s
sets where the cardinality of
s
varies from 1 to
n
. We investigate properties of skyband-set query computation and develop pruning strategies to avoid unnecessary objectset enumerations as well as comparisons among them. We conduct a set of experiments to show the effectiveness and efficiency of the propose algorithm.
