Parallel computation of skyline queries

Skyline queries have received considerable attention in the database community recently. The goal is to retrieve all records in a database that have the property that no other record is better according to all of a given set of criteria. While this problem has been well studied in the computa-tional geometry literature, the solution of this problem in the database context requires techniques designed partic-ularly to handle large amounts of data. In this paper, we show that parallel computing is an effective method to speed up the answering of skyline queries on large data sets. We also propose to preprocess the set of data points to quickly answer subsequent skyline queries on any subset of the di-mensions. 1