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

On the Foundations of Computing Deltas between RDF models

by: Dimitris Zeginis and Yannis Tzitzikas and Vassilis Christophides

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. 631--644.

Resources (URL, PDF, PS...)

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

Abstract

The ability to compute the differences that exist between two RDF models is an important step to cope with the evolving nature of the Semantic Web SW. In particular, RDF Deltas can be employed to reduce the amount of data that need to be exchanged and managed over the network and hence build advanced SW synchronization and versioning services. By considering Deltas as sets of change operations, in this paper we study various RDF comparison functions in conjunction with the semantics of the underlying change operations and formally analyze their possible combinations in terms of correctness, minimality, semantic identity and redundancy properties.

BibTeX record

@inproceedings{Zeginis/2007/Foundations,
  address = {Berlin, Heidelberg},
  author = {Dimitris Zeginis and Yannis Tzitzikas and Vassilis Christophides},
  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 = {8c6780b52f8c14dc70afe69d330d4b7f},
  intraHash = {b371dc088473e2780f05be37b8030cc5},
  pages = {631--644},
  publisher = {Springer Verlag},
  series = {LNCS},
  title = {On the Foundations of Computing Deltas between RDF models},
  url = {http://iswc2007.semanticweb.org/papers/631.pdf},
  volume = {4825},
  year = {2007},
  month = {November},
  abstract = {The ability to compute the differences that exist between two RDF models is an important step to cope with the evolving nature of the Semantic Web (SW). In particular, RDF Deltas can be employed to reduce the amount of data that need to be exchanged and managed over the network and hence build advanced SW synchronization and versioning services. By considering Deltas as sets of change operations, in this paper we study various RDF comparison functions in conjunction with the semantics of the underlying change operations and formally analyze their possible combinations in terms of correctness, minimality, semantic identity and redundancy properties.}
}

Endnote record

%0 Conference Paper
%1 Zeginis/2007/Foundations
%A Dimitris Zeginis
%A Yannis Tzitzikas
%A Vassilis Christophides
%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 631--644
%T On the Foundations of Computing Deltas between RDF models
%U http://iswc2007.semanticweb.org/papers/631.pdf
%V 4825
%X The ability to compute the differences that exist between two RDF models is an important step to cope with the evolving nature of the Semantic Web (SW). In particular, RDF Deltas can be employed to reduce the amount of data that need to be exchanged and managed over the network and hence build advanced SW synchronization and versioning services. By considering Deltas as sets of change operations, in this paper we study various RDF comparison functions in conjunction with the semantics of the underlying change operations and formally analyze their possible combinations in terms of correctness, minimality, semantic identity and redundancy properties.