Sciweavers

Share
SIGMOD
2006
ACM

Finding k-dominant skylines in high dimensional space

12 years 5 months ago
Finding k-dominant skylines in high dimensional space
Given a d-dimensional data set, a point p dominates another point q if it is better than or equal to q in all dimensions and better than q in at least one dimension. A point is a skyline point if there does not exists any point that can dominate it. Skyline queries, which return skyline points, are useful in many decision making applications. Unfortunately, as the number of dimensions increases, the chance of one point dominating another point is very low. As such, the number of skyline points become too numerous to offer any interesting insights. To find more important and meaningful skyline points in high dimensional space, we propose a new concept, called k-dominant skyline which relaxes the idea of dominance to k-dominance. A point p is said to k-dominate another point q if there are k ( d) 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. We prov...
Chee Yong Chan, H. V. Jagadish, Kian-Lee Tan, Anth
Added 08 Dec 2009
Updated 08 Dec 2009
Type Conference
Year 2006
Where SIGMOD
Authors Chee Yong Chan, H. V. Jagadish, Kian-Lee Tan, Anthony K. H. Tung, Zhenjie Zhang
Comments (0)
books