Details
| Original language | English |
|---|---|
| Title of host publication | CAiSE 2003 |
| Subtitle of host publication | Advanced Information Systems Engineering |
| Editors | Johann Eder, Michele Missikoff |
| Publisher | Springer Verlag |
| Pages | 258-272 |
| Number of pages | 15 |
| ISBN (electronic) | 978-3-540-45017-7 |
| ISBN (print) | 978-3-540-40442-2 |
| Publication status | Published - 18 Jun 2003 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 2681 |
| ISSN (Print) | 0302-9743 |
| ISSN (electronic) | 1611-3349 |
Abstract
Peer-to-peer (P2P) networks have become an important infrastructure during the last years. Using P2P networks for distributed information systems allows us to shift the focus from centrally organized to distributed information systems where all peers can provide and have access to information. In previous papers, we have described an RDF-based P2P infrastructure called Edutella which is a specific example of a more advanced approach to P2P networks called schema-based peer-to-peer networks. Schema-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster or Gnutella. Instead of prescribing one global schema to describe content, they support arbitrary metadata schemas and ontologies (crucial for the Semantic Web). Thereby they allow complex and extendable descriptions of resources thus introducing dynamic behavior to the former fixed and limited descriptions, and can provide complex query facilities against these metadata instead of simple keyword-based searches. In this paper we will elaborate topologies, indices and query routing strategies for efficient query distribution in such networks. Our work is based on the concept of super-peer networks which provide better scalability compared to traditional P2P networks. By adapting existing concepts of mediator-based information systems to super-peer based networks, as we will show in this paper, they are able to support sophisticated routing, clustering and mediation strategies based on the metadata schemas and attributes. The resulting routing indices can be built using local clustering policies and support local mediation and transformation rules between heterogeneous schemas, and we sketch some first ideas for implementing these advanced functionalities as well.
ASJC Scopus subject areas
- Mathematics(all)
- Theoretical Computer Science
- Computer Science(all)
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
CAiSE 2003: Advanced Information Systems Engineering. ed. / Johann Eder; Michele Missikoff. Springer Verlag, 2003. p. 258-272 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2681).
Research output: Chapter in book/report/conference proceeding › Contribution to book/anthology › Research › peer review
}
TY - CHAP
T1 - Information integration in schema-based peer-to-peer networks
AU - Löser, Alexander
AU - Siberski, Wolf
AU - Wolpers, Martin
AU - Nejdl, Wolfgang
PY - 2003/6/18
Y1 - 2003/6/18
N2 - Peer-to-peer (P2P) networks have become an important infrastructure during the last years. Using P2P networks for distributed information systems allows us to shift the focus from centrally organized to distributed information systems where all peers can provide and have access to information. In previous papers, we have described an RDF-based P2P infrastructure called Edutella which is a specific example of a more advanced approach to P2P networks called schema-based peer-to-peer networks. Schema-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster or Gnutella. Instead of prescribing one global schema to describe content, they support arbitrary metadata schemas and ontologies (crucial for the Semantic Web). Thereby they allow complex and extendable descriptions of resources thus introducing dynamic behavior to the former fixed and limited descriptions, and can provide complex query facilities against these metadata instead of simple keyword-based searches. In this paper we will elaborate topologies, indices and query routing strategies for efficient query distribution in such networks. Our work is based on the concept of super-peer networks which provide better scalability compared to traditional P2P networks. By adapting existing concepts of mediator-based information systems to super-peer based networks, as we will show in this paper, they are able to support sophisticated routing, clustering and mediation strategies based on the metadata schemas and attributes. The resulting routing indices can be built using local clustering policies and support local mediation and transformation rules between heterogeneous schemas, and we sketch some first ideas for implementing these advanced functionalities as well.
AB - Peer-to-peer (P2P) networks have become an important infrastructure during the last years. Using P2P networks for distributed information systems allows us to shift the focus from centrally organized to distributed information systems where all peers can provide and have access to information. In previous papers, we have described an RDF-based P2P infrastructure called Edutella which is a specific example of a more advanced approach to P2P networks called schema-based peer-to-peer networks. Schema-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster or Gnutella. Instead of prescribing one global schema to describe content, they support arbitrary metadata schemas and ontologies (crucial for the Semantic Web). Thereby they allow complex and extendable descriptions of resources thus introducing dynamic behavior to the former fixed and limited descriptions, and can provide complex query facilities against these metadata instead of simple keyword-based searches. In this paper we will elaborate topologies, indices and query routing strategies for efficient query distribution in such networks. Our work is based on the concept of super-peer networks which provide better scalability compared to traditional P2P networks. By adapting existing concepts of mediator-based information systems to super-peer based networks, as we will show in this paper, they are able to support sophisticated routing, clustering and mediation strategies based on the metadata schemas and attributes. The resulting routing indices can be built using local clustering policies and support local mediation and transformation rules between heterogeneous schemas, and we sketch some first ideas for implementing these advanced functionalities as well.
UR - http://www.scopus.com/inward/record.url?scp=35248841926&partnerID=8YFLogxK
U2 - 10.1007/3-540-45017-3_19
DO - 10.1007/3-540-45017-3_19
M3 - Contribution to book/anthology
AN - SCOPUS:35248841926
SN - 978-3-540-40442-2
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 258
EP - 272
BT - CAiSE 2003
A2 - Eder, Johann
A2 - Missikoff, Michele
PB - Springer Verlag
ER -