Efficient G-Skyline queries based on skyline layer batch processing

Abstract

Skyline query is a prevalent multi-objective optimization problem designed to identify points in a given dataset that are not dominated by any other points. Although it traditionally emphasizes the analysis of individual points, real-life scenarios often demand consideration of combined queries, given the necessity for optimal combinations. In addressing this, we explore the Skyline query algorithm with a focus on grouping, presenting an efficient G-Skyline query algorithm. Our approach involves a streamlined batch processing algorithm that groups all points to compute the skyline points for the initial l layers. Experimental results demonstrate that our algorithms outperform previous work in terms of speed.