Notice of RetractionFinding k-dominant skyline in dynamic data set

K-dominant skyline query can get fewer skyline points in dealing with high dimension data set, and this query is very useful to help user make decision. But the existent algorithms are all designed for static data set, and invalid for dynamic data set. To solve above problem, an relevant algorithm for data set change is proposed in this paper, which is that when the data set changes, the new k-dominant skyline is got by testing part points based on existent k-dominant skyline. The correct and efficiency of algorithm are proved, and the algorithm is also analyzed and verified by experiment.

[1]  Liu Xin.  Algorithm for skyline queries based on window query , 2005 .

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

[3]  Jing Yu,et al.  AN ALGORITHM FOR SKYLINE QUERIES BASED ON WINDOW QUERY , 2005 .

[4]  Jian Pei,et al.  Catching the Best Views of Skyline: A Semantic Approach Based on Decisive Subspaces , 2005, VLDB.

[5]  Kian-Lee Tan,et al.  Efficient processing of skyline queries with partially-ordered domains , 2005, 21st International Conference on Data Engineering (ICDE'05).

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

[7]  Jiawei Han,et al.  Mining Thick Skylines over Large Databases , 2004, PKDD.

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

[9]  Xin Liu,et al.  A Window-based Algorithm for Skyline Queries , 2005, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05).

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

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