Given a set of rf-dimensional points, skyline query returns the points that are not dominated by any other point on all dimensions. In this paper, we study an interesting scenario of skyline retrieval, where multi-dimensional points are distributed among multiple disks. Efficient algorithms for parallelizing progressive skyline computation are developed, using the parallel R-trees. The core of our scheme is to visit more entries from some disks simultaneously and enable effective pruning strategies with dominance checking to prune away the non-qualifying entries. Extensive experiments with synthetic data confirm that our proposed algorithms are both efficient and scalable. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Gao, Y., Chen, G., Chen, L., & Chen, C. (2006). Parallelizing progressive computation for skyline queries in multi-disk environment. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4080 LNCS, pp. 697–706). Springer Verlag. https://doi.org/10.1007/11827405_68
Mendeley helps you to discover research relevant for your work.