Paths to stardom: calibrating the potential of a peer-based data management system

As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database applications. Indexing methods are adapted on top of P2P networks and querying methods are developed to handle the data distribution on different nodes. These procedures largely depend on how nodes are connected to each other. So far, limited attempts have been made to compare all these systems in a generalized framework. This is because the systems are quite different from each other, and there are so many of them that brute force comparison is practically impossible. Fortunately, it has recently been observed that a large subset of the most important P2P networks share a common algebraic and combinatorial base, in the form of Cayley graphs. The specific requirements of Peer-based Data Management Systems (PDMS), such as query completeness, range queries, load balancing, communication overhead, and scalabili...

• Type: Conference
• Year: 2008
• Where: SIGMOD
• Authors: Mihai Lupu, Beng Chin Ooi, Y. C. Tay
• Keywords: Cayley Graphs, Database, Important P2p Networks, Peer-based Data Management, SIGMOD 2008