Parallel Computation of Skyline Queries

• Published in: HPCS 2007 : 21st International Symposium on High Performance Computing Systems and Applications : 13-16 May 2007, Saskatoon, Saskatchewan, Canada p. 12
• Main Authors: Cosgaya-Lozano, A., Rau-Chaplin, A., Zeh, N.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.05.2007
• Subjects: Computational geometry; Computer science; Concurrent computing; Database systems; Information retrieval; Parallel processing; Spatial databases; Statistics
• ISBN: 0769528139; 9780769528137
• DOI: 10.1109/HPCS.2007.25

Skyline queries have received considerable attention in the database community. 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 computational geometry literature, the solution of this problem in the database context requires techniques designed particularly 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 dimensions.