K. Endris, S. Faisal, F. Orlandi, S. Auer, and S. Scerri. International Semantic Web Conference (1), volume 9366 of Lecture Notes in Computer Science, page 513-529. Springer, (2015)
Abstract
Many LOD datasets, such as DBpedia and LinkedGeoData, are voluminous and process large amounts of requests from diverse applications. Many data products and services rely on full or partial local LOD replications to ensure faster querying and processing. Given the evolving nature of the original and authoritative datasets, to ensure consistent and up-to-date replicas frequent replacements are required at a great cost. In this paper, we introduce an approach for interest-based RDF update propagation, which propagates only interesting parts of updates from the source to the target dataset. Effectively, this enables remote applications to ‘subscribe’ to relevant datasets and consistently reflect the necessary changes locally without the need to frequently replace the entire dataset (or a relevant subset). Our approach is based on a formal definition for graph-pattern-based interest expressions that is used to filter interesting parts of updates from the source. We implement the approach in the iRap framework and perform a comprehensive evaluation based on DBpedia Live updates, to confirm the validity and value of our approach.
%0 Conference Paper
%1 conf/semweb/EndrisFOAS15
%A Endris, Kemele M.
%A Faisal, Sidra
%A Orlandi, Fabrizio
%A Auer, Sören
%A Scerri, Simon
%B International Semantic Web Conference (1)
%D 2015
%E Arenas, Marcelo
%E Corcho, Óscar
%E Simperl, Elena
%E Strohmaier, Markus
%E d'Aquin, Mathieu
%E Srinivas, Kavitha
%E Groth, Paul T.
%E Dumontier, Michel
%E Heflin, Jeff
%E Thirunarayan, Krishnaprasad
%E Staab, Steffen
%I Springer
%K data linked myown rdf-update sparql
%P 513-529
%T Interest-Based RDF Update Propagation.
%U http://iswc2015.semanticweb.org/sites/iswc2015.semanticweb.org/files/93660465.pdf
%V 9366
%X Many LOD datasets, such as DBpedia and LinkedGeoData, are voluminous and process large amounts of requests from diverse applications. Many data products and services rely on full or partial local LOD replications to ensure faster querying and processing. Given the evolving nature of the original and authoritative datasets, to ensure consistent and up-to-date replicas frequent replacements are required at a great cost. In this paper, we introduce an approach for interest-based RDF update propagation, which propagates only interesting parts of updates from the source to the target dataset. Effectively, this enables remote applications to ‘subscribe’ to relevant datasets and consistently reflect the necessary changes locally without the need to frequently replace the entire dataset (or a relevant subset). Our approach is based on a formal definition for graph-pattern-based interest expressions that is used to filter interesting parts of updates from the source. We implement the approach in the iRap framework and perform a comprehensive evaluation based on DBpedia Live updates, to confirm the validity and value of our approach.
%@ 978-3-319-25006-9
@inproceedings{conf/semweb/EndrisFOAS15,
abstract = {Many LOD datasets, such as DBpedia and LinkedGeoData, are voluminous and process large amounts of requests from diverse applications. Many data products and services rely on full or partial local LOD replications to ensure faster querying and processing. Given the evolving nature of the original and authoritative datasets, to ensure consistent and up-to-date replicas frequent replacements are required at a great cost. In this paper, we introduce an approach for interest-based RDF update propagation, which propagates only interesting parts of updates from the source to the target dataset. Effectively, this enables remote applications to ‘subscribe’ to relevant datasets and consistently reflect the necessary changes locally without the need to frequently replace the entire dataset (or a relevant subset). Our approach is based on a formal definition for graph-pattern-based interest expressions that is used to filter interesting parts of updates from the source. We implement the approach in the iRap framework and perform a comprehensive evaluation based on DBpedia Live updates, to confirm the validity and value of our approach.},
added-at = {2017-10-03T16:32:02.000+0200},
author = {Endris, Kemele M. and Faisal, Sidra and Orlandi, Fabrizio and Auer, Sören and Scerri, Simon},
biburl = {https://www.bibsonomy.org/bibtex/23194bb6fbfd637cb8242cf3b66e6a6b3/endris},
booktitle = {International Semantic Web Conference (1)},
crossref = {conf/semweb/2015-1},
editor = {Arenas, Marcelo and Corcho, Óscar and Simperl, Elena and Strohmaier, Markus and d'Aquin, Mathieu and Srinivas, Kavitha and Groth, Paul T. and Dumontier, Michel and Heflin, Jeff and Thirunarayan, Krishnaprasad and Staab, Steffen},
ee = {http://dx.doi.org/10.1007/978-3-319-25007-6_30},
interhash = {35e48618a247de8c1d29d804f6ba8710},
intrahash = {3194bb6fbfd637cb8242cf3b66e6a6b3},
isbn = {978-3-319-25006-9},
keywords = {data linked myown rdf-update sparql},
pages = {513-529},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2017-10-03T16:47:01.000+0200},
title = {Interest-Based RDF Update Propagation.},
url = {http://iswc2015.semanticweb.org/sites/iswc2015.semanticweb.org/files/93660465.pdf},
volume = 9366,
year = 2015
}