Algorithm of Finding k-dominant Skylines for Dynamic Datasets
Dongming Zhang · Journal of Chinese Computer Systems · 2009
K-dominant skylines query can return little number of skyline points in high dimensional spaces,helping users to make decisions.But at present all the algorithms are designed for static datasets,not for dynamic datasets.Dynamic data consists of non-data-stream and data-stream,in this paper,the increasement algorithms for these two instances are proposed,getting the new result through computing partial points based on the existent k-dominant skylines when dataset changes.The correctness and validity of the algorithm are proved,and the algorithm is analyzed and validated by experiments.