Download now Free registration required
Skyline queries are important due to their usefulness in many application domains. However, by increasing the number of attributes, the probability that a tuple dominates an-other one is reduced significantly. To attack this problem, k-dominant skylines have been proposed, relaxing the definition of domination. In this paper, the authors study the problem of continuous monitoring of k-dominant skylines, where multiple queries are running concurrently. The proposed method divides the space in pairs of attributes. For each pair, they compute skyline tuples and they exploit them to eliminate candidates tuples of the queries and they combine the partial results.
- Format: PDF
- Size: 244.26 KB