Computing dominances inEn (short communication)
Information Processing Letters
Scalable parallel geometric algorithms for coarse grained multicomputers
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
On Finding the Maxima of a Set of Vectors
Journal of the ACM (JACM)
Proceedings of the 17th International Conference on Data Engineering
"Balls into Bins" - A Simple and Tight Analysis
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Progressive skyline computation in database systems
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Maximal vector computation in large data sets
VLDB '05 Proceedings of the 31st international conference on Very large data bases
MapReduce: simplified data processing on large clusters
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Parallel Computation of Skyline Queries
HPCS '07 Proceedings of the 21st International Symposium on High Performance Computing Systems and Applications
Approaching the skyline in Z order
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Angle-based space partitioning for efficient parallel skyline computation
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
On weighted balls-into-bins games
Theoretical Computer Science
Parallel Skyline Computation on Multicore Architectures
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
AGiDS: A Grid-Based Strategy for Distributed Skyline Query Processing
Globe '09 Proceedings of the 2nd International Conference on Data Management in Grid and Peer-to-Peer Systems
Building a high-level dataflow system on top of Map-Reduce: the Pig experience
Proceedings of the VLDB Endowment
Optimizing joins in a map-reduce environment
Proceedings of the 13th International Conference on Extending Database Technology
A model of computation for MapReduce
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Parallel evaluation of conjunctive queries
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient parallel skyline processing using hyperplane projections
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Parallelizing skyline queries for scalable distribution
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Breaking skyline computation down to the metal: the skyline breaker algorithm
Proceedings of the 17th International Database Engineering & Applications Symposium
Skyline queries, front and back
ACM SIGMOD Record
Parallel computation of skyline and reverse skyline queries using mapreduce
Proceedings of the VLDB Endowment
Parallel skyline queries over uncertain data streams in cloud computing environments
International Journal of Web and Grid Services
| Hi-index | 0.00 |
In this paper, we design and analyze parallel algorithms for skyline queries. The skyline of a multidimensional set consists of the points for which no other point exists that is at least as good along every dimension. As a framework for parallel computation, we use both the MP model proposed in (Koutris and Suciu, PODS 2011), which requires that the data is perfectly load-balanced, and a variation of the model in (Afrati and Ullman, EDBT 2010), the GMP model, which demands weaker load balancing constraints. In addition to load balancing, we want to minimize the number of blocking steps, where all processors must wait and synchronize. We propose a 2-step algorithm in the MP model for any dimension of the dataset, as well a 1-step algorithm for the case of 2 and 3 dimensions. Moreover, we present a 1-step algorithm in the GMP model for any number of dimensions.