Materializing Distributed Skyline Queries

摘要

In this paper, we tackle the problem of efficient skycube computation in structured P2P systems. We introduce a top-down algorithm called Distributed-Top-Sky based on the recently introduced Top-Sky. Furthermore, we introduce two types of nodes namely the Scheduling-Node where the network is organized by assigning the computation of each cuboid to a Data-Node and the Data-Node which holds a part of the dataset used to compute the assigned cuboids. In order to evaluate the effectiveness of our approach, we have conducted extensive experiments on three real datasets over a simulated CAN (content addressable network) network.