BIRCH: an efficient data clustering method for very large databases
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
On the Average Number of Maxima in a Set of Vectors and Applications
Journal of the ACM (JACM)
An optimal and progressive algorithm for skyline queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Stabbing the Sky: Efficient Skyline Computation over Sliding Windows
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
SUBSKY: Efficient Computation of Skylines in Subspaces
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Hi-index | 0.00 |
Skyline queries, which return the objects that are better than or equal in all dimensions and better in at least one dimension, are useful in many decision making and monitor applications. With the number of dimensions increasing and continuous large volume data arriving, mining the approximate skylines over data stream under control of losing quality is a more meaningful problem. In this paper, firstly, we propose a novel concept, called approximate skyline. Then, an algorithm is developed which prunes the skyline objects within the acceptable difference and adopts correlation coefficient to adjust adaptively approximate query quality. Furthermore, our experiments show that the proposed methods are both efficient and effective.