Abstract
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.
Highlights
To select important objects from a large-scale database is one of the most important processes to analyze the database
To address the issues related to set selection problem, we propose a “K-skyband-set”
If we consider s = 2 and k = 2, a skyband-set query based on data set D outputs {OS1,2, OS1,3, OS1,6, OS2,3, OS2,5, OS2,6, OS3,4} as the query results
Summary
To select important objects from a large-scale database is one of the most important processes to analyze the database. Borzsony et al have been proposed a query that retrieves a set of objects where each is not dominated by another object in the database [1]. For s = 2, an objectset skyline query retrieves the result of {OS1,2, OS2,3, OS2,6} because no other objectset can dominate them (see Fig. 2). After computing all combinations of three stocks, we need to check the dominance of these combinations to obtain the objectset skyline result. For combinations of three stocks, the objectset skyline query retrieves {OS1,2,3, OS1,2,6, OS2,3,4, OS2,3,6} as the output result (see Fig. 3). Existing methods are not suitable for solving objectset queries
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Advanced Computer Science and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
