| Summary: | 碩士 === 國立東華大學 === 資訊工程學系 === 98 === Skyline queries are useful in many applications such as multi-criteria decision making, data mining, and user preference queries. However, as the number of dimensions increases, the probability that a point dominates another one is reduced significantly. As a result, the number of skyline points become too numerous to offer any interesting insights. To solve this problem, the concept of k-dominant skylines was proposed. A point p is said to k-dominate another point q if there are k ( ) dimensions in which p is better than or equal to q and is better in at least one of these k dimensions. A point that is not k-dominated by any other points is in the k-dominant skyline.
In this thesis, the problem of k-dominant skyline computation is discussed. By analyzing the properties of k-dominant skyline, an efficient method is proposed. Moreover, a set of experiments is performed to show the efficiency of our approach.
|
|---|
