skip to main content
10.1145/775152.775229acmconferencesArticle/Chapter ViewAbstractPublication PageswwwConference Proceedingsconference-collections
Article

Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks

Published:20 May 2003Publication History

ABSTRACT

RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHORD. RDF-based P2P networks allow complex and extendable descriptions of resources instead of fixed and limited ones, and they provide complex query facilities against these metadata instead of simple keyword-based searches.In previous papers, we have described the Edutella infrastructure and different kinds of Edutella peers implementing such an RDF-based P2P network. In this paper we will discuss these RDF-based P2P networks as a specific example of a new type of P2P networks, schema-based P2P networks, and describe the use of super-peer based topologies for these networks. Super-peer based networks can provide better scalability than broadcast based networks, and do provide perfect support for inhomogeneous schema-based networks, which support different metadata schemas and ontologies (crucial for the Semantic Web). Furthermore, as we will show in this paper, they are able to support sophisticated routing and clustering strategies based on the metadata schemas, attributes and ontologies used. Especially helpful in this context is the RDF functionality to uniquely identify schemas, attributes and ontologies. The resulting routing indices can be built using dynamic frequency counting algorithms and support local mediation and transformation rules, and we will sketch some first ideas for implementing these advanced functionalities as well.

References

  1. K. Aberer and M. Hauswirth. Semantic gossiping. In Database and Information Systems Research for Semantic Web and Enterprises, Invitational Workshop, University of Georgia, Amicalola Falls and State Park, Georgia, April 2002.Google ScholarGoogle Scholar
  2. L. A. Adamic, R. M. Lukose, A. R. Puniyani, and B. A. Huberman. Search in Power-law Networks. In Physical Review E, 64 46135, 2001.Google ScholarGoogle ScholarCross RefCross Ref
  3. P. A. Bernstein, F. Giunchiglia, A. Kementsietsidis, J. Mylopoulos, L. Serafini, and I. Zaihrayeu. Data management for peer-to-peer computing: A vision. In Proceedings of the Fifth International Workshop on the Web and Databases, Madison, Wisconsin, June 2002.Google ScholarGoogle Scholar
  4. S. Busse. Model Correspondences in Continuous Engineering of MBIS - doctoral thesis. Logos Verlag, September 2002.Google ScholarGoogle Scholar
  5. S. Chawathe, H. Garcia-Molina, J. Hammer, K. Ireland, Y. Papakonstantinou, J. Ullman, and J. Widom. The TSIMMIS project: Integration of heterogeneous information sources. In Proceedings of IPSJ Conference, Tokyo, Japan, October 1994.Google ScholarGoogle Scholar
  6. A. Crespo and H. Garcia-Molina. Routing indices for peer-to-peer systems. In Proceedings International Conference on Distributed Computing Systems, July 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. A. Crespo and H. Garcia-Molina. Semantic overlay networks, November 2002. Submitted for publication.Google ScholarGoogle Scholar
  8. M. Harren, J. M. Hellerstein, R. Huebsch, B. T. Loo, S. Shenker, and I. Stoica. Complex queries in DHT-based peer-to-peer networks. In F. Kaashoek and A. Rowstron, editors, Proceedings for the 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), March 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. R. Korfhage. Information Storage and Retrieval. John Wiley, New York, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. U. Leser. Query Planning in Mediator Based Information Systems - doctoral thesis. TU Berlin, June 2000.Google ScholarGoogle Scholar
  11. G. S. Manku and R. Motwani. Approximate frequency counts over data streams. In Proceedings of the 28th International Conference on Very Large Data Bases, Hong Kong, China, August 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. W. Nejdl, B. Wolf, C. Qu, S. Decker, M. Sintek, A. Naeve, M. Nilsson, M. Palmér, and T. Risch. EDUTELLA: a P2P Networking Infrastructure based on RDF. In WWW 11 Conference Proceedings, Hawaii, USA, May 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content addressable network. In Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. ACM Press New York, NY, USA, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. G. Salton. Automatic Text Processing: The Transformation, Retrieval and Analysis of Information by Computer. Addison Wesley, Reading, MA, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. S. Saroiu, P. K. Gummadi, and S. D. Gribble. A measurement study of peer-to-peer file sharing systems. In Proceedings of Multimedia Computing and Networking (MMCN), January 2002.Google ScholarGoogle Scholar
  16. M. Schlosser, M. Sintek, S. Decker, and W. Nejdl. HyperCuP--Hypercubes, Ontologies and Efficient Search on P2P Networks. In International Workshop on Agents and Peer-to-Peer Computing, Bologna, Italy, July 2002.Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. ACM Press New York, NY, USA, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. G. Wiederhold. Mediators in the architecture of future information systems. IEEE Computer, 25(3):38--49, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. B. Yang and H. Garcia-Molina. Designing a super-peer network. http://dbpubs.stanford.edu:8090/pub/2002-13, 2002.Google ScholarGoogle Scholar

Index Terms

  1. Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in
            • Published in

              cover image ACM Conferences
              WWW '03: Proceedings of the 12th international conference on World Wide Web
              May 2003
              772 pages
              ISBN:1581136803
              DOI:10.1145/775152

              Copyright © 2003 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 20 May 2003

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • Article

              Acceptance Rates

              Overall Acceptance Rate1,899of8,196submissions,23%

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader