Proceedings of the 17th International Conference on Data Engineering
A system for interactive modeling of physical curved surface objects
SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
An optimal and progressive algorithm for skyline queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
SaLSa: computing the skyline without scanning the whole sky
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
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
Parallel computing with vertical data
IRE-AIEE-ACM '60 (Eastern) Papers presented at the December 13-15, 1960, eastern joint IRE-AIEE-ACM computer conference
Parallel Skyline Computation on Multicore Architectures
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
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
| Hi-index | 0.00 |
The skyline operator for multi-criteria search returns the most interesting points of a data set with respect to any monotone preference function. Existing work has almost exclusively focused on efficiently computing skylines on one or more CPUs, ignoring the high parallelism possible in GPUs. In this paper we investigate the challenges for efficient skyline algorithms that exploit the computational power of the GPU. We present a novel strategy for managing data transfer and memory for skylines using CPU and GPU. Our new sorting based data-parallel skyline algorithm is introduced and its properties are discussed. We demonstrate in a thorough experimental evaluation that this algorithm is faster than state-of-the-art sequential sorting based skyline algorithms and that it shows superior scalability.