BibSonomyburst/user/berrueta/patchBibSonomy RSS feed for /user/berrueta/patch2012-02-16T14:10:11+01:00http://www.bibsonomy.org/bibtex/292eea7d67d287e8ce65090654c2878bc/berruetaberrueta2007-11-20T20:18:20+01:002007 bnodes diff iswc msg mymobileweb patch rdf rdfsync rsync sync <span class="authorEditorList"><a href="/author/Morbidoni">Christian Morbidoni</a>, <a href="/author/Tummarello">Giovanni Tummarello</a>, <a href="/author/Erling">Orri Erling</a>, and <a href="/author/Bachmann-Gmür">Reto Bachmann-Gmür</a> </span><em>Proceedings of the 6th International Semantic Web Conference and 2nd Asian Semantic Web Conference ISWC/ASWC2007, Busan, South Korea, </em><em>volume 4825 of LNCS, </em><em>page 533--546. </em><em>Berlin, Heidelberg, </em><em>Springer Verlag, </em>(<em>November 2007</em>)Tue Nov 20 20:18:20 CET 2007Berlin, HeidelbergProceedings of the 6th International Semantic Web Conference and 2nd Asian Semantic Web Conference (ISWC/ASWC2007), Busan, South Koreahttp://data.semanticweb.org/conference/iswc-aswc/2007/proceedingsNovember533--546LNCSRDFSync: efficient remote synchronization of RDF models482520072007 bnodes diff iswc msg mymobileweb patch rdf rdfsync rsync sync 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.