Super-Peer-Based Routing and Clustering Strategies for RDF-Based Peer-to-Peer Networks (2002)
Cached
Download Links
- [www.kbs.uni-hannover.de]
- [www.kbs.uni-hannover.de]
- [www.comp.nus.edu.sg]
- [cis.cs.tu-berlin.de]
- DBLP
Other Repositories/Bibliography
| Citations: | 111 - 23 self |
BibTeX
@INPROCEEDINGS{Nejdl02super-peer-basedrouting,
author = {Wolfgang Nejdl and Martin Wolpers and Wolf Siberski and Christoph Schmitz and Mario Schlosser and Ingo Brunkhorst and Alexander Löser},
title = {Super-Peer-Based Routing and Clustering Strategies for RDF-Based Peer-to-Peer Networks},
booktitle = {},
year = {2002},
pages = {536--543}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
