PeerSum: Summary Management in P2P Systems

Sharing huge, massively distributed databases in P2P systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer sufficient. A practical approach is to rely on compact database summaries rather than raw database records, whose access is costly in large P2P systems. In this paper, we consider summaries that are synthetic, multidimensional views with two main virtues. First, they can be directly queried and used to approximately answer a query without exploring the original data. Second, as semantic indexes, they support locating relevant nodes based on data content. The main contribution of this paper is to define an efficient algorithm for partitioning an unstructured P2P network into domains, in order to optimally distribute summaries in the network. Then, we propose a distributed algorithm for maintaining a summary in a given domain. Our performance evaluation shows that the cost of query routing is minimized, while incu...

• Type: Conference
• Year: 2007
• Where: BDA
• Authors: Rabab Hayek, Guillaume Raschia, Patrick Valduriez, Noureddine Mouaddib
• Keywords: BDA 2007, Knowledge Management, Large P2p Systems, P2P Systems, Unstructured P2p Network