An efficient method of computing the k-dominant skyline efficiently by partition value

摘要: Skyline queries are useful in many applications such as multicriteria decision-making, data mining, and user-preference queries. However, the probability that a point dominates another one reduces significantly number of dimensions increases, which results skyline points becoming too numerous to offer any interesting insights. The concept k-dominant was previously proposed solve this problem. A p is said k-dominate q if there k (≤ d) better than or equal at least these dimensions. not k-dominated by other skyline. This paper addresses problem computing By analyzing properties skyline, four lemmas derived reduce effort required select candidates prune false positives during computation. set experiments showed our method can efficiently compute for independent, correlated anticorrelated datasets.