Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.websem.2003.11.004 | Journal of Web Semantics |
Keywords | Field | DocType |
Peer-to-Peer,Semantic Web,Schema-based routing,Distributed RDF repositories,Routing protocols,Semantic networks | Data mining,Metadata,Link-state routing protocol,Peer-to-peer,Computer science,Semantic Web,Network topology,RDF,Routing protocol,Scalability | Journal |
Volume | Issue | ISSN |
1 | 2 | 1570-8268 |
Citations | PageRank | References |
26 | 1.10 | 13 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wolfgang Nejdl | 1 | 6633 | 556.13 |
| Martin Wolpers | 2 | 968 | 88.85 |
| Wolf Siberski | 3 | 841 | 47.51 |
| Christoph Schmitz | 4 | 220 | 10.66 |
| Mario T. Schlosser | 5 | 2157 | 153.71 |
| Ingo Brunkhorst | 6 | 280 | 17.06 |
| Alexander Löser | 7 | 473 | 34.93 |