Selecting Stars: The k Most Representative Skyline Operator

Skyline computation has many applications including multi-criteria decision making. In this paper, we study the problem of selecting k skyline points so that the number of points, which are dominated by at least one of these k skyline points, is maximized. We first present an efficient dynamic programming based exact algorithm in a 2d-space. Then, we show that the problem is NP-hard when the dimensionality is 3 or more and it can be approximately solved by a polynomial time algorithm with the guaranteed approximation ratio 1 - 1 e . To speed-up the computation, an efficient, scalable, index-based randomized algorithm is developed by applying the FM probabilistic counting technique. A comprehensive performance evaluation demonstrates that our randomized technique is very efficient, highly accurate, and scalable.

• Type: Conference
• Year: 2007
• Where: ICDE
• Authors: Xuemin Lin, Yidong Yuan, Qing Zhang, Ying Zhang
• Keywords: Database, ICDE 2007, Index-based Randomized Algorithm, Polynomial Time Algorithm, Skyline Points