An Index Based Efficient k-Dominant Skyline Algorithm
Yao Shu · Chinese Journal of Computers · 2010
Due to the importance for several applications involving multi-criteria decision making,skyline query has received a lot of attention in the research field of database and data mining in recent years.However,as the number of dimensions increase,the possibility to form dominant relationship between data points is very low.As a result,the number of skyline points becomes too numerous to provide any useful information.For the sake of finding more important and more meaningful skyline points in high dimension data set,a new concept called k-dominant skyline was proposed.Currently the algorithms used for k-dominant skyline query do not have good performance on the time and space complexity.None of them is a good online algorithm.This paper proposes a new index based algorithm,by building two index of the data set,the algorithm can efficiently compute k-dominant skyline.It is an online algorithm and has better performance than all of current algorithms.