On Finding the Maxima of a Set of Vectors
Journal of the ACM (JACM)
On the Average Number of Maxima in a Set of Vectors and Applications
Journal of the ACM (JACM)
Multidimensional binary search trees used for associative searching
Communications of the ACM
Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Optimal Dynamic Range Searching in Non-replicating Index Structures
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Proceedings of the 17th International Conference on Data Engineering
Efficient Progressive Skyline Computation
Proceedings of the 27th International Conference on Very Large Data Bases
Stabbing the Sky: Efficient Skyline Computation over Sliding Windows
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Progressive skyline computation in database systems
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Stratified computation of skylines with partially-ordered domains
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Semantics and evaluation techniques for window aggregates in data streams
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
Maintaining Sliding Window Skylines on Data Streams
IEEE Transactions on Knowledge and Data Engineering
Skyline Queries Against Mobile Lightweight Devices in MANETs
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Refreshing the sky: the compressed skycube with efficient support for frequent updates
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
On-the-fly sharing for streamed aggregation
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Algorithms and analyses for maximal vector computation
The VLDB Journal — The International Journal on Very Large Data Bases
Towards multidimensional subspace skyline analysis
ACM Transactions on Database Systems (TODS)
Efficient continuous skyline computation
Information Sciences: an International Journal
Shooting stars in the sky: an online algorithm for skyline queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Resource sharing in continuous sliding-window aggregates
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Probabilistic skylines on uncertain data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficient computation of reverse skyline queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Topologically Sorted Skylines for Partially Ordered Domains
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Scalable skyline computation using object-based space partitioning
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Minimizing the communication cost for continuous skyline maintenance
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Kernel-based skyline cardinality estimation
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Reverse skyline search in uncertain databases
ACM Transactions on Database Systems (TODS)
Z-SKY: an efficient skyline query processing framework based on Z-order
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient skyline evaluation over partially ordered domains
Proceedings of the VLDB Endowment
Supporting efficient distributed skyline computation using skyline views
Information Sciences: an International Journal
Information Sciences: an International Journal
Skyline queries on keyword-matched data
Information Sciences: an International Journal
Hi-index | 0.07 |
Given a set of data objects, the skyline query returns the objects that are not dominated by others. Although skyline computation has been studied extensively for static data, there has been relatively less work on data streams. Recently, a few methods have been proposed to process a single continuous skyline query over a data stream. However, efficient techniques that can handle multiple skyline queries have not been much considered. In this paper, we propose a new method, called FAST, for processing multiple continuous skyline queries over a data stream. FAST uses a filtering technique that can early discard an object that will not be a member of any future skyline of continuous queries, and uses a discriminant that can efficiently determine which objects in memory are skyline objects for which queries. We present that the proposed method FAST can compute skylines of multiple continuous queries very efficiently. Through extensive experiments, we show the high performance and great scalability of the proposed method.