Skyline Diagram: Efficient Space Partitioning for Skyline Queries

Skyline queries are important in many application domains. In this paper, we propose a novel structure Diagram, which given set of points, partitions the plane into regions, referred to as skyline polyominos. All query points same polyomino have results. Similar kth-order Voronoi diagram commonly used facilitate k nearest neighbor (kNN) queries, can be and other applications. However, it may computationally expensive build diagram. By exploiting some interesting properties skyline, present several efficient algorithms for building with respect three kinds quadrant, global, dynamic skylines. addition, an approximate significantly reduce space cost. Experimental results on both real synthetic datasets show that our scalable.