Random sampling with a reservoir
ACM Transactions on Mathematical Software (TOMS)
Computing dominances inEn (short communication)
Information Processing Letters
On Finding the Maxima of a Set of Vectors
Journal of the ACM (JACM)
Space-efficient online computation of quantile summaries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Proceedings of the 17th International Conference on Data Engineering
Efficient Progressive Skyline Computation
Proceedings of the 27th International Conference on Very Large Data Bases
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Optimal dynamic interval management in external memory
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Efficient algorithms for new computational models
Efficient algorithms for new computational models
Efficient Processing of Skyline Queries with Partially-Ordered Domains
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
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
Maintaining Sliding Window Skylines on Data Streams
IEEE Transactions on Knowledge and Data Engineering
Robust Cardinality and Cost Estimation for Skyline Operator
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Algorithms and analyses for maximal vector computation
The VLDB Journal — The International Journal on Very Large Data Bases
Machine models and lower bounds for query processing
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Shooting stars in the sky: an online algorithm for skyline queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Probabilistic skylines on uncertain data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficient skyline computation over low-cardinality domains
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Probabilistic computations: Toward a unified measure of complexity
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Efficient skyline querying with variable user preferences on nominal attributes
Proceedings of the VLDB Endowment
Online Skyline Analysis with Dynamic Preferences on Nominal Attributes
IEEE Transactions on Knowledge and Data Engineering
Distributed Skyline Retrieval with Low Bandwidth Consumption
IEEE Transactions on Knowledge and Data Engineering
Distance-Based Representative Skyline
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Online Interval Skyline Queries on Time Series
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Probabilistic Skyline Operator over Sliding Windows
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Parallel Skyline Computation on Multicore Architectures
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Topologically Sorted Skylines for Partially Ordered Domains
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Top-k vectorial aggregation queries in a distributed environment
Journal of Parallel and Distributed Computing
Distributed threshold querying of general functions by a difference of monotonic representation
Proceedings of the VLDB Endowment
(Approximate) uncertain skylines
Proceedings of the 14th International Conference on Database Theory
On finding skylines in external memory
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Worst-Case I/O-Efficient Skyline Algorithms
ACM Transactions on Database Systems (TODS)
SkyDiver: a framework for skyline diversification
Proceedings of the 16th International Conference on Extending Database Technology
I/O-efficient planar range skyline and attrition priority queues
Proceedings of the 32nd symposium on Principles of database systems
Skyline operator on anti-correlated distributions
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
We consider external algorithms for skyline computation without pre-processing. Our goal is to develop an algorithm with a good worst case guarantee while performing well on average. Due to the nature of disks, it is desirable that such algorithms access the input as a stream (even if in multiple passes). Using the tools of randomness, proved to be useful in many applications, we present an efficient multi-pass streaming algorithm, RAND, for skyline computation. As far as we are aware, RAND is the first randomized skyline algorithm in the literature. RAND is near-optimal for the streaming model, which we prove via a simple lower bound. Additionally, our algorithm is distributable and can handle partially ordered domains on each attribute. Finally, we demonstrate the robustness of RAND via extensive experiments on both real and synthetic datasets. RAND is comparable to the existing algorithms in average case and additionally tolerant to simple modifications of the data, while other algorithms degrade considerably with such variation.