Paper Info
Title
RDFSync: efficient remote synchronization of RDF models
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.
Year
DOI
Venue
2007
10.1007/978-3-540-76298-0_39
ISWC/ASWC
Keywords
Field
DocType
illustrating theory,minimum self-contained graph,file-oriented synchronization,efficient synchronization,rdfsync algorithm,serialized rdf graph,efficient remote synchronization,information fragment,synchronization procedure,rdf model
Graph,Data mining,Synchronization,Computer science,Theoretical computer science,Hash function,Merge (version control),RDF,Database,Rdf graph
Conference
Volume
ISSN
ISBN
4825
0302-9743
3-540-76297-3
Citations 
PageRank 
References 
36
2.57
5
Authors
4
Name
Order
Citations
PageRank
Giovanni Tummarello11106104.63
Christian Morbidoni228937.76
Reto Bachmann-Gmür3362.57
Orri Erling448932.75