Computing the k-Dominant Skyline Efficiently in Dynamic Environments
| Autor: | Chun-Kai Tseng, 曾俊凱 |
|---|---|
| Rok vydání: | 2014 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 102 Most data nowadays is being stored in the network, therefore, there are substantial need of an efficient approach on finding important information from the data. One of the technologies called skyline query is being used in many applications, such as multi-criteria decision making and user preference queries. However, as the number of dimensions increase, the probability that a point dominates another point decreases. As a result, there are a lot of skyline points will be retrieved in a high dimensional dataset. Therefore, the concept of k-dominant skylines was proposed to deal with this problem. In real application, data is kept changing dynamically, therefore an efficient approach on computing dynamic data is necessary required. In this research, an approach of maintaining k-dominant skyline in a dynamic environment is proposed. By keeping some information of the original k-dominant skylines, we can compute the changing skyline efficiently. Moreover, a set of experiments is performed to show the efficiency of our approach. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|