Inproceedings148: Unterschied zwischen den Versionen
K (Added from ontology) |
K (Added from ontology) |
||
Zeile 1: | Zeile 1: | ||
+ | {{Publikation Author | ||
+ | |Rank=1 | ||
+ | |Author=Wolfgang Nejdl | ||
+ | }} | ||
+ | {{Publikation Author | ||
+ | |Rank=7 | ||
+ | |Author=Alexander Löser | ||
+ | }} | ||
{{Publikation Author | {{Publikation Author | ||
|Rank=2 | |Rank=2 | ||
Zeile 6: | Zeile 14: | ||
|Rank=3 | |Rank=3 | ||
|Author=Wolf Siberski | |Author=Wolf Siberski | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
}} | }} | ||
{{Publikation Author | {{Publikation Author | ||
Zeile 24: | Zeile 24: | ||
}} | }} | ||
{{Publikation Author | {{Publikation Author | ||
− | |Rank= | + | |Rank=6 |
− | |Author= | + | |Author=Ingo Brunkhorst |
}} | }} | ||
{{Inproceedings | {{Inproceedings | ||
Zeile 55: | Zeile 55: | ||
|VG Wort-Seiten= | |VG Wort-Seiten= | ||
|Link=http://projekte.learninglab.uni-hannover.de/pub/bscw.cgi/d15458/Super Peer Based Routing and Clustering Strategies for RDF-Based Peer-To-Peer Networks | |Link=http://projekte.learninglab.uni-hannover.de/pub/bscw.cgi/d15458/Super Peer Based Routing and Clustering Strategies for RDF-Based Peer-To-Peer Networks | ||
− | |||
|Projekt=PADLR, | |Projekt=PADLR, | ||
|Forschungsgruppe= | |Forschungsgruppe= | ||
+ | }} | ||
+ | {{Forschungsgebiet Auswahl | ||
+ | |Forschungsgebiet=E-Learning | ||
+ | }} | ||
+ | {{Forschungsgebiet Auswahl | ||
+ | |Forschungsgebiet=Wissensmanagement | ||
+ | }} | ||
+ | {{Forschungsgebiet Auswahl | ||
+ | |Forschungsgebiet=Semantic Web | ||
}} | }} |
Version vom 15. August 2009, 19:15 Uhr
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
BibTeX
Kurzfassung
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