Efficient Skyline Computation in Structured Peer-to-Peer Systems

[jagadeesh486]

---

[attachment=4229]

---

This article is presented by: Bin Cui, Senior Member, IEE, Lijiang Chen, Student Member, IEE, Linhao Xu,
Hua Lu, Member, IEE, Guojie Song, and Quanqing Xu

---

ABSTRACT

PEER-TO-PEER (P2P) computing systems have been thought of as a powerful paradigm for data sharing, and peerbased data management has attracted increasing interest from the database and information retrieval communities recently. Due to its desirable features like low deployment cost, but high scalability, flexibility, and computing capability, P2P has been widely used in various applications such as resource sharing, scientific computation, and distributed data management [5], [8], [16], [27], [29]. Among these, marrying P2P computing with data management technology and exploiting P2P protocol to process various queries are of special interests. So far, conventional queries including nearest neighbor (NN) queries and range queries [19], [22] have been successfully adapted to P2P networks. In these precedents, queries against a large number of distributed sites have been facilitated by the flexible and powerful functionalities of the P2P networks. The success of such queries undoubtedly encourages further attempts to adapt other kinds of queries to the P2P networks. Skyline query is one of the hot spots in this field.

---