Subscribe

Issue No.02 - February (2011 vol.23)

pp: 204-217

Lijiang Chen , Peking University, Beijing

Bin Cui , Peking University, Beijing

Hua Lu , Aalborg University, Aalborg

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2010.103

ABSTRACT

The skyline of a multidimensional point set is a subset of interesting points that are not dominated by others. In this paper, we investigate constrained skyline queries in a large-scale unstructured distributed environment, where relevant data are distributed among geographically scattered sites. We first propose a partition algorithm that divides all data sites into incomparable groups such that the skyline computations in all groups can be parallelized without changing the final result. We then develop a novel algorithm framework called PaDSkyline for parallel skyline query processing among partitioned site groups. We also employ intragroup optimization and multifiltering technique to improve the skyline query processes within each group. In particular, multiple (local) skyline points are sent together with the query as filtering points, which help identify unqualified local skyline points early on a data site. In this way, the amount of data to be transmitted via network connections is reduced, and thus, the overall query response time is shortened further. Cost models and heuristics are proposed to guide the selection of a given number of filtering points from a superset. A cost-efficient model is developed to determine how many filtering points to use for a particular data site. The results of an extensive experimental study demonstrate that our proposals are effective and efficient.

INDEX TERMS

Constrained skyline query, filtering point, distributed query processing.

CITATION

Lijiang Chen, Bin Cui, Hua Lu, "Constrained Skyline Query Processing against Distributed Data Sites",

*IEEE Transactions on Knowledge & Data Engineering*, vol.23, no. 2, pp. 204-217, February 2011, doi:10.1109/TKDE.2010.103REFERENCES