The input/output complexity of sorting and related problems
Communications of the ACM
Computing dominances inEn (short communication)
Information Processing Letters
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)
Output-size sensitive algorithms for finding maximal vectors
SCG '85 Proceedings of the first annual symposium on Computational geometry
Dynamic Maintenance of Maxima of 2-d Point Sets
SIAM Journal on Computing
Multidimensional divide-and-conquer
Communications of the ACM
Proceedings of the 17th International Conference on Data Engineering
A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
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
Finding k-dominant skylines in high dimensional space
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
Shooting stars in the sky: an online algorithm for skyline queries
VLDB '02 Proceedings of the 28th 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
Continuous k-dominant skyline computation on multidimensional data streams
Proceedings of the 2008 ACM symposium on Applied computing
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
External-memory computational geometry
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
K-Dominant Skyline Computation by Using Sort-Filtering Method
PAKDD '09 Proceedings of the 13th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
Randomized multi-pass streaming skyline algorithms
Proceedings of the VLDB Endowment
Instance-Optimal Geometric Algorithms
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Online subspace skyline query processing using the compressed skycube
ACM Transactions on Database Systems (TODS)
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
Skyline queries, front and back
ACM SIGMOD Record
| Hi-index | 0.00 |
We consider the skyline problem (a.k.a. the maxima problem), which has been extensively studied in the database community. The input is a set P of d-dimensional points. A point dominates another if the former has a lower coordinate than the latter on every dimension. The goal is to find the skyline, which is the set of points p ∈ P such that p is not dominated by any other data point. In the external-memory model, the 2-d version of the problem is known to be solvable in O((N/B)logM/B(N/B)) I/Os, where N is the cardinality of P, B the size of a disk block, and M the capacity of main memory. For fixed d ≥ 3, we present an algorithm with I/O-complexity O((N/B)logd-2/M/B(N/B)). Previously, the best solution was adapted from an in-memory algorithm, and requires O((N/B) logd-2/2(N/M)) I/Os.