Design of PeerSum: A Summary Service for P2P Applications

Sharing huge databases in distributed systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer sufficient. A more efficient approach is to rely on compact database summaries rather than raw database records, whose access is costly in large distributed systems. In this paper, we propose PeerSum, a new service for managing summaries over shared data in large P2P and Grid applications. Our summaries 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. Our main contribution is to define a summary model for P2P systems, and the algorithms for summary management. Our performance evaluation shows that the cost of query routing is minimized, while incurring a low cost of summary maintenance.

• Type: Conference
• Year: 2007
• Where: GPC
• Authors: Rabab Hayek, Guillaume Raschia, Patrick Valduriez, Noureddine Mouaddib
• Keywords: Compact Database Summaries, Data Localization Techniques, Distributed Systems, GPC 2007