Col-Graph: Towards Writable and Scalable Linked Open Data - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Col-Graph: Towards Writable and Scalable Linked Open Data


Linked Open Data faces severe issues of scalability, availability and data quality. these issues are observed by data consumers performing federated queries; SPARQL endpoints do not respond and results can be wrong or out-of-date. If a data consumer finds an error, how can she fix it? This raises the issue of the writability of Linked Data. In this paper, we devise aan extension of the federation of Linked Data to data consumers. A data consumer can make partial copies of different datasets and make them available through a SPARQL endpoint. A data consumer can update her local copy and share updates with data providers and consumers. Update sharing improves general data quality, and replicated data creates opportunities for federated query engines to improve availability. However, when updates occur in an uncontrolled way, consistency issues arise. In this paper, we define fragments as SPARQL CONSTRUCT queries and propose a correction criterion to maintain these fragments incrementally without reevaluating the query. We define a coordination free protocol based on the counting of triples derivations and provenance. We analyze the theoretical complexity of the protocol in time, space and traffic. Experimental results suggest the scalability of our approach.


Fichier principal
Vignette du fichier
main.pdf (741.32 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01061493 , version 1 (08-11-2014)


  • HAL Id : hal-01061493 , version 1


Luis-Daniel Ibanez, Hala Skaf-Molli, Pascal Molli, Olivier Corby. Col-Graph: Towards Writable and Scalable Linked Open Data. ISWC - The 13th International Semantic Web Conference, Oct 2014, Riva del Garda, Italy. ⟨hal-01061493⟩
374 View
282 Download


Gmail Facebook Twitter LinkedIn More