Efficient Skyline Retrieval on Peer-to-Peer Networks

The skyline of a data set is the set of points that are not dominated by any other point. A number of algorithms have been developed for skyline computation on centralized databases, but only a little work has been done on skyline retrieval on P2P networks. Existing P2P skyline algorithms are particularly designed for subspace skylining, or constrained to certain network infrastructure, thus inapplicable for others. This paper proposes a novel skyline retrieval algorithm based on one of the most distinguished P2P network infrastructures, Chord, and minimizes the bandwidth consumption as well as the number of visited nodes. The algorithm progressively outputs the skyline points and provides means to keep query load balance. Both theoretical analysis and experimental results confirm the efficiency and scalability of the proposed algorithm.