Abstract-Skyline queries are capable of retrieving interesting points from a large data set according to multiple criteria. Most work on skyline queries so far has assumed a centralized storage, whereas in practice relevant data are often distributed among geographically scattered sites. In this work, we tackle constrained skyline queries in large-scale distributed environments without the assumption of any overlay structures, and propose a novel algorithm named PaDSkyline (Parallel Distributed Skyline query processing). PaDSkyline significantly shortens the response time by performing parallel processing over site groups produced by a partition algorithm. Within each group, it locally optimizes the query processing over distributed sites. It also drastically enhances the network transmission efficiency by performing early reduction of skyline candidates with deliberately selected multiple filtering points. Results of extensive experiments demonstrate the efficiency and robustness of our proposals.
Cui et al. REF introduced skyline queries in large-scale distributed environments without the assumption of any overlay structures and propose PaDSkyline algorithm.
Parallel Distributed Processing of Constrained Skyline Queries by Filtering
2008 IEEE 24th International Conference on Data Engineering
2008 IEEE 24th International Conference on Data Engineering
Computer Science