SkyTree: scalable skyline computation for sensor data
Proceedings of the Third International Workshop on Knowledge Discovery from Sensor Data
Skyline queries with constraints: Integrating skyline and traditional query operators
Data & Knowledge Engineering
Randomized multi-pass streaming skyline algorithms
Proceedings of the VLDB Endowment
BSkyTree: scalable skyline computation using a balanced pivot selection
Proceedings of the 13th International Conference on Extending Database Technology
Data & Knowledge Engineering
VSkyline: vectorization for efficient skyline computation
ACM SIGMOD Record
Ten thousand SQLs: parallel keyword queries computing
Proceedings of the VLDB Endowment
Parallel skyline computation on multicore architectures
Information Systems
Efficient parallel skyline processing using hyperplane projections
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Information Sciences: an International Journal
Probabilistic skylines on uncertain data: model and bounding-pruning-refining methods
Journal of Intelligent Information Systems
Highly scalable multiprocessing algorithms for preference-based database retrieval
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Proceedings of the 15th International Conference on Database Theory
Parallel processing for stepwise generalisation method on multi-core PC cluster
International Journal of Knowledge and Web Intelligence
Efficient GPU-based skyline computation
Proceedings of the Ninth International Workshop on Data Management on New Hardware
Scalable skyline computation using a balanced pivot selection technique
Information Systems
Parallel skyline queries over uncertain data streams in cloud computing environments
International Journal of Web and Grid Services
| Hi-index | 0.00 |
With the advent of multicore processors,it has become imperative to write parallel programs if one wishes to exploit the next generation of processors. This paper deals with skyline computation as a case study of parallelizing database operations on multicore architectures. We compare two parallel skyline algorithms: a parallel version of the branch-and-bound algorithm (BBS) and a new parallel algorithm based on skeletal parallel programming. Experimental results show despite its simple design, the new parallel algorithm is comparable to parallel BBS in speed. For sequential skyline computation, the new algorithm far outperforms sequential BBS when the density of skyline tuples is low.