Skyband-Set for Answering Top-k Set Queries of Any Users

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.

[1]  Chiang Lee,et al.  Top-k Combinatorial Skyline Queries , 2010, DASFAA.

[2]  Jian Pei,et al.  SUBSKY: Efficient Computation of Skylines in Subspaces , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[3]  Mohammad Anisuzzaman Siddique,et al.  Algorithm for Computing Convex Skyline Objectsets on Numerical Databases , 2010, IEICE Trans. Inf. Syst..

[4]  Christos Doulkeridis,et al.  SKYPEER: Efficient Subspace Skyline Computation over Distributed Data , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[5]  Jan Chomicki,et al.  Skyline with presorting , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[6]  Donald Kossmann,et al.  The Skyline operator , 2001, Proceedings 17th International Conference on Data Engineering.

[7]  Bernhard Seeger,et al.  Progressive skyline computation in database systems , 2005, TODS.

[8]  Bernhard Seeger,et al.  Efficient Computation of Reverse Skyline Queries , 2007, VLDB.

[9]  Yufei Tao,et al.  On Skylining with Flexible Dominance Relation , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[10]  Bernhard Seeger,et al.  An optimal and progressive algorithm for skyline queries , 2003, SIGMOD '03.

[11]  Beng Chin Ooi,et al.  Efficient Progressive Skyline Computation , 2001, VLDB.

[12]  Jan Chomicki,et al.  Hippo: A System for Computing Consistent Answers to a Class of SQL Queries , 2004, EDBT.

[13]  Cong Yu,et al.  Constructing and exploring composite items , 2010, SIGMOD Conference.

[14]  Donald Kossmann,et al.  Shooting Stars in the Sky: An Online Algorithm for Skyline Queries , 2002, VLDB.

[15]  Wolf-Tilo Balke,et al.  Efficient Distributed Skylining for Web Information Systems , 2004, EDBT.

[16]  Seung-won Hwang,et al.  Navigation system for product search , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).

[17]  Dimitrios Gunopulos,et al.  Efficient Confident Search in Large Review Corpora , 2010, ECML/PKDD.

[18]  Hongjun Lu,et al.  Stabbing the sky: efficient skyline computation over sliding windows , 2005, 21st International Conference on Data Engineering (ICDE'05).

[19]  Yoshiharu Ishikawa,et al.  Combination Skyline Queries , 2012, Trans. Large Scale Data Knowl. Centered Syst..

[20]  Raymond Chi-Wing Wong,et al.  Finding top-k profitable products , 2011, 2011 IEEE 27th International Conference on Data Engineering.

[21]  Lei Zou,et al.  Dynamic Skyline Queries in Large Graphs , 2010, DASFAA.

[22]  Anthony K. H. Tung,et al.  Finding k-dominant skylines in high dimensional space , 2006, SIGMOD Conference.

[23]  Yunhao Liu,et al.  Energy-Efficient Reverse Skyline Query Processing over Wireless Sensor Networks , 2012, IEEE Transactions on Knowledge and Data Engineering.