BibSonomy :: BibTeX ::

tag user group author concept BibTeX key search:all search:iswc2007

A blue social bookmark and publication sharing system.

entry of iswc2007 and 2 other people: spam

RDFSync: efficient remote synchronization of RDF models

by: Christian Morbidoni and Giovanni Tummarello and Orri Erling and Reto Bachmann-Gmür

In: Proceedings of the 6th International Semantic Web Conference and 2nd Asian Semantic Web Conference ISWC/ASWC2007, Busan, South Korea , Vol. 4825Berlin, Heidelberg: Springer Verlag , November (2007) , p. 533--546.

Resources (URL, PDF, PS...)

URL:	http://iswc2007.semanticweb.org/papers/533.pdf

Abstract

In this paper we describe RDFSync, a methodology for efficient synchronization and merging of RDF models. RDFSync is based on decomposing a model into Minimum Self-Contained graphs MSGs. After illustrating theory and deriving properties of MSGs, we show how a RDF model can be represented by a list of hashes of such information fragments. The synchronization procedure here described is based on the evaluation and remote comparison of these ordered lists. Experimental results show that the algorithm provides very significant savings on network traffic compared to the file-oriented synchronization of serialized RDF graphs. Finally, we provide the design and report the implementation of a protocol for executing the RDFSync algorithm over HTTP.

BibTeX record

@inproceedings{Morbidoni/2007/RDFSync:,
  address = {Berlin, Heidelberg},
  author = {Christian Morbidoni and Giovanni Tummarello and Orri Erling and Reto Bachmann-Gmür},
  booktitle = {Proceedings of the 6th International Semantic Web Conference and 2nd Asian Semantic Web Conference (ISWC/ASWC2007), Busan, South Korea},
  crossref = {http://data.semanticweb.org/conference/iswc-aswc/2007/proceedings},
  editor = {Karl Aberer and Key-Sun Choi and Natasha Noy and Dean Allemang and Kyung-Il Lee and Lyndon J B Nixon and Jennifer Golbeck and Peter Mika and Diana Maynard and Guus Schreiber and Philippe Cudré-Mauroux},
  interHash = {6a5df8ef21c0a50304ae2f1da1d61671},
  intraHash = {92eea7d67d287e8ce65090654c2878bc},
  pages = {533--546},
  publisher = {Springer Verlag},
  series = {LNCS},
  title = {RDFSync: efficient remote synchronization of RDF models},
  url = {http://iswc2007.semanticweb.org/papers/533.pdf},
  volume = {4825},
  year = {2007},
  month = {November},
  abstract = {In this paper we describe RDFSync, a methodology for efficient synchronization and merging of RDF models. RDFSync is based on decomposing a model into Minimum Self-Contained graphs (MSGs). After illustrating theory and deriving properties of MSGs, we show how a RDF model can be represented by a list of hashes of such information fragments. The synchronization procedure here described is based on the evaluation and remote comparison of these ordered lists. Experimental results show that the algorithm provides very significant savings on network traffic compared to the file-oriented synchronization of serialized RDF graphs. Finally, we provide the design and report the implementation of a protocol for executing the RDFSync algorithm over HTTP.}
}

Endnote record

%0 Conference Paper
%1 Morbidoni/2007/RDFSync:
%A Christian Morbidoni
%A Giovanni Tummarello
%A Orri Erling
%A Reto Bachmann-Gmür
%B Proceedings of the 6th International Semantic Web Conference and 2nd Asian Semantic Web Conference (ISWC/ASWC2007), Busan, South Korea
%C Berlin, Heidelberg
%D 2007
%E Karl Aberer
%E Key-Sun Choi
%E Natasha Noy
%E Dean Allemang
%E Kyung-Il Lee
%E Lyndon J B Nixon
%E Jennifer Golbeck
%E Peter Mika
%E Diana Maynard
%E Guus Schreiber
%E Philippe Cudré-Mauroux
%I Springer Verlag
%K 
%P 533--546
%T RDFSync: efficient remote synchronization of RDF models
%U http://iswc2007.semanticweb.org/papers/533.pdf
%V 4825
%X In this paper we describe RDFSync, a methodology for efficient synchronization and merging of RDF models. RDFSync is based on decomposing a model into Minimum Self-Contained graphs (MSGs). After illustrating theory and deriving properties of MSGs, we show how a RDF model can be represented by a list of hashes of such information fragments. The synchronization procedure here described is based on the evaluation and remote comparison of these ordered lists. Experimental results show that the algorithm provides very significant savings on network traffic compared to the file-oriented synchronization of serialized RDF graphs. Finally, we provide the design and report the implementation of a protocol for executing the RDFSync algorithm over HTTP.