Selection of Important Sets by using K-Skyband Query for Sets

In this paper, we consider “sets” selection problem from a database. In conventional selection problem, which is “objects” selection problem, the skyline query has been utilized, since it can retrieve a set of important objects where each object isn’t dominated by another object in a database. However, it is not effective when we have to select important sets, each of which contains more than one objects. Thus, we consider a “set skyline query” that retrieves non-dominated sets of objects from a database, which we call “object sets.” The K-skyband query is a popular variant of the skyline query. It retrieves a set of objects, each of which is not dominated by K other objects. In this paper, we propose “K-Skyband set query.” It retrieves important sets instead of objects. We investigated the properties of the query, as well as developing pruning strategies to avoid the unnecessary enumeration of objectsets and comparisons among them. Intensive experiments have been performed to examine the implemented algorithm. The results demonstrate the effectiveness and efficiency of the proposed algorithm.