DocumentCode
554091
Title
Notice of Retraction
Finding k-dominant skyline in dynamic data set
Author
Xiao-wei Cui ; Lei-gang Dong ; Hong Zou ; Xiang-ming An
Author_Institution
Dept. of Comput. Sci. & Inf. Technol., DaQing Normal Univ., DaQing, China
Volume
3
fYear
2011
fDate
26-28 July 2011
Firstpage
1247
Lastpage
1250
Abstract
Notice of Retraction
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
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.
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
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.
Keywords
data analysis; decision making; query processing; decision making; dynamic data set; k-dominant skyline query; static data set; Algorithm design and analysis; Educational institutions; Heuristic algorithms; Indexes; Nearest neighbor searches; Runtime; Security; dynamic data set; high dimension; k-dominant skyline query;
fLanguage
English
Publisher
ieee
Conference_Titel
Natural Computation (ICNC), 2011 Seventh International Conference on
Conference_Location
Shanghai
ISSN
2157-9555
Print_ISBN
978-1-4244-9950-2
Type
conf
DOI
10.1109/ICNC.2011.6022271
Filename
6022271
Link To Document