An I/O cost optimal and progressive algorithm for computing massive skyline points

We describe an I/O cost optimal algorithm for computing skyline points among a set of d-dimensional points. In this paper we develop Partitioning, a progressive algorithm based on branch and bound search. It computes the skyline points in a progressive way that is outputting results while the algorithm is running. Our progressive (or online) algorithm can quickly return the first skyline point, without having to read the entire data file, this property is important in the database community.