Skip to main content

Design of PeerSum: A Summary Service for P2P Applications

  • Conference paper
Advances in Grid and Pervasive Computing (GPC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4459))

Included in the following conference series:

  • 836 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Aberer, K., et al.: P-grid: a self-organizing structured P2P system. SIGMOD Rec 32(3) (2003)

    Google Scholar 

  2. Akbarinia, R., et al.: Replication and query processing in the APPA data management system. In: Workshop on Distributed Data and Structures (WDAS’2004) (2004)

    Google Scholar 

  3. Chakravarti, A., Baumgartner, G., Lauria, M.: The organic grid: self-organizing computation on a peer-to-peer network. IEEE Transactions on Systems, Man, and Cybernetics, Part A 35(3), 373–384 (2005)

    Article  Google Scholar 

  4. Crespo, A., Garcia-Molina, H.: Routing indices for peer-to-peer systems. In: Proc. of the 28th Conference on Distributed Computing Systems (July 2002)

    Google Scholar 

  5. Crespo, A., Garcia-Molina, H.: Semantic overlay networks for P2P systems. Technical report, Computer Science Department, Stanford University (2002)

    Google Scholar 

  6. Foster, I., Iamnitchi, A.: On death, taxes, and the convergence of peer-to-peer and grid computing. In: IPTPS, pp. 118–128 (2003)

    Google Scholar 

  7. Howell, F., McNab, R.: Simjava: a discrete event simulation package for java with the applications in computer systems modeling. In: Int. Conf on Web-based Modelling and Simulation, San Diego CA, Society for Computer Simulation (1998)

    Google Scholar 

  8. http://www.cs.bu.edu/brite/

  9. Open grid services architecture data access and integration. http://www.ogsadai.org.uk

  10. http://www.snomed.org/snomedct

  11. Koloniari, G., Petrakis, Y., Pitoura, E.: Content–based overlay networks of xml peers based on multi-level bloom filters. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds.) VLDB 2003. LNCS, vol. 2944, Springer, Heidelberg (2004)

    Google Scholar 

  12. Oser, A., et al.: Semantic overlay clusters within super-peer networks. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds.) VLDB 2003. LNCS, vol. 2944, Springer, Heidelberg (2004)

    Google Scholar 

  13. Ozsu, T., Valduriez, P.: Principles of Distributed Database Systems. Prentice-Hall, Englewood Cliffs (1999)

    Google Scholar 

  14. Raschia, G., Mouaddib, N.: A fuzzy set-based approach to database summarization. Fuzzy sets and systems 129(2), 137–162 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  15. Ratnasamy, S., et al.: A scalable content–addressable network. In: Proc. SIGCOMM (2001)

    Google Scholar 

  16. Saint-Paul, R., Raschia, G., Mouaddib, N.: General purpose database summarization. In: Proc. VLDB, pp. 733–744 (2005)

    Google Scholar 

  17. Saroiu, S., Gummadi, P., Gribble, S.: A measurement study of peer-to-peer file sharing systems. In: Proc. of Multimedia Computing and Networking (MMCN) (2002)

    Google Scholar 

  18. Stoica, I., et al.: Chord: A scalabale peer-to-peer lookup service for internet applications. In: Proc. ACM SIGCOMM (2001)

    Google Scholar 

  19. Tartinov, I., et al.: The piazza peer data management project. SIGMOD Record 32(3) (2003)

    Google Scholar 

  20. Voglozin, A., et al.: Querying the SaintEtiQ summaries-a first attempt. In: Christiansen, H., et al. (eds.) FQAS 2004. LNCS (LNAI), vol. 3055, Springer, Heidelberg (2004)

    Google Scholar 

  21. Zadeh, L.: Concept of a linguistic variable and its application to approximate reasoning. Information and Systems 1, 119–249 (1975)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Christophe Cérin Kuan-Ching Li

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Hayek, R., Raschia, G., Valduriez, P., Mouaddib, N. (2007). Design of PeerSum: A Summary Service for P2P Applications. In: Cérin, C., Li, KC. (eds) Advances in Grid and Pervasive Computing. GPC 2007. Lecture Notes in Computer Science, vol 4459. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72360-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72360-8_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72359-2

  • Online ISBN: 978-3-540-72360-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics