Answering Continuous Rank Join Query in P2P Networks

Peer-to-peer (P2P) networks are achieved more and more attention, compared with C/S service mode, P2P is more suitable for distributed data flow processing. This paper concentrates on how to answer continuous rank join query in P2P networks. In the algorithm proposed, the data that cannot contribute the final ranked results will be discarded directly based on pre-computing the minimum values of rank function´s attributes. Experiments show that the algorithm ensures the availability of rank query and network traffic is reduced up to 90% as well as.