Aus Aifbportal
Version vom 16. Oktober 2009, 17:30 Uhr von Nicole Arlt (Diskussion | Beiträge) (Wikipedia python library)
(Unterschied) ← Nächstältere Version | Aktuelle Version (Unterschied) | Nächstjüngere Version → (Unterschied)
Wechseln zu:Navigation, Suche

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

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

Published: 2003

Buchtitel: Proc. 12th International World Wide Web Conference. Budapest, 20.-24.5.2003
Seiten: 536-543

Referierte Veröffentlichung


RDF-based P2P networks have a number of advantages compared to simpler P2P networks such as Napster, Gnutella or to approaches based on distributed indices on binary keys 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 this paper we will discuss RDF-based P2P networks like Edutella 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 provide support for inhomogeneous schema-based networks, with different metadata schemas and ontologies (crucial for the Semantic Web). Based on (dynamic) metadata routing indices, stated in RDF, the super-peer network supports sophisticated routing and distribution strategies, as well as preparing the ground for advanced mediation and clustering functionalities.

Weitere Informationen unter: Link






E-Learning, Semantic Web, Web Science