Angle-based space partitioning for efficient parallel skyline computation

Recently, skyline queries have attracted much attention in the database research community. Space partitioning techniques, such as recursive division of the data space, have been used for skyline query processing in centralized, parallel and distributed settings. Unfortunately, such grid-based partitioning is not suitable in the case of a parallel skyline query, where all partitions are examined at the same time, since many data partitions do not contribute to the overall skyline set, resulting in a lot of redundant processing. In this paper we propose a novel angle-based space partitioning scheme using the hyperspherical coordinates of the data points. We demonstrate both formally as well as through an exhaustive set of experiments that this new scheme is very suitable for skyline query processing in a parallel sharenothing architecture. The intuition of our partitioning technique is that the skyline points are equally spread to all partitions. We also show that partitioning the data...

• Type: Conference
• Year: 2008
• Where: SIGMOD
• Authors: Akrivi Vlachou, Christos Doulkeridis, Yannis Kotidis
• Keywords: Database, Parallel Skyline Query, SIGMOD 2008, Skyline Query Processing, Space Partitioning Scheme