Finding 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 kdominant skyline. The correct and efficiency of algorithm are proved, and the algorithm is also analyzed and verified by experiment.

关键词： k-dominant skyline query high dimension dynamic data set

作者: Xiao-wei Cui Lei-gang Dong Hong Zou Xiang-ming An

作者单位: Department of Computer Science and Information Technology DaQing Normal University DaQing , Heilongjiang, 163712. China

会议类型: 国际会议

会议名称: 2011 Seventh International Conference on Natural Computation(第七届自然计算国际会议 ICNC 2011)

会议地点: 上海

会议语种:英文

页码: 1273-1276

在线出版日期: 2011-07-26（万方平台首次上网日期，不代表论文的发表时间）