srCE: a collaborative editing of scalable semantic stores on P2P networks

Zarzour, Hafed; Sellami, Mokhtar

doi:10.1504/ijcat.2013.055562

Cited by 5 publications

(5 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, SU-Set relies on causal delivery of the underlying network, which is challenging and can pose problems in highly dynamic platforms. 32 Methods reviewed in this section are limited to sharing and synchronizing semantic stores without taking into consideration neither the OAC anatomy nor the collaborative annotation in a distributed manner. Therefore, a new CRDT for OAC is proposed as an extension to OAC data model in order to support not only the collaborative annotation aspect but also to enable concurrent annotations while guaranteeing CCI preservation criteria.…”

Section: Crdts For Collaborative Systemsmentioning

confidence: 99%

“…(ii) Convergence: when the system is idle, all copies are identical. (iii) Intention: the expected effect of a delete and insert operation must be observed on all copies 32 . This means that for any operations, the effects of running an operation at all sites are the same as its intention, and the effect of running this operation does not change the effects of independent operations.…”

Section: Background and Related Workmentioning

confidence: 99%

“…Therefore, SU‐Set modifies the operations to send the relevant set of triples to affect one by one, but that could flood the network with traffic considering the potential size of an RDF‐Graph. However, SU‐Set relies on causal delivery of the underlying network, which is challenging and can pose problems in highly dynamic platforms 32 …”

Section: Background and Related Workmentioning

confidence: 99%

See 2 more Smart Citations

A conflict‐free replicated data type for collaborative annotation systems

Zarzour

Jararweh

2020

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

With the advent of Web 2.0, numerous collaborative annotation systems have been developed in an effort to enable distant users to annotate the same multimedia resources such as texts, audio, images, and videos. However, the existing systems do not support the semantic aspect of the data available on the Web and ignore the convergence aspect when executing concurrent annotations. Based on the technologies of Semantic Web, this article presents a new conflict-free replicated data type called OAC-Set, which extends Open Annotation Collaboration data model to enable concurrent annotations while guaranteeing convergence, causality, and intention preservation criteria. The experimental results show that our approach is efficient and effective.

show abstract

Section: Crdts For Collaborative Systemsmentioning

confidence: 99%

Section: Background and Related Workmentioning

confidence: 99%

Section: Background and Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A conflict‐free replicated data type for collaborative annotation systems

Zarzour

Jararweh

2020

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

show abstract

“…Their main goal is to provide versioning to Linked Data, they do not consider any correctness criterion when networks of collaborators copy fragments from each other, and they do not allow fragmentation, i.e., the full repository needs to be copied each time. [10,25] use eventual consistency as correctness criterion. However, this requires that all updates to be eventually delivered to all participants, which is not compatible with fragmentation nor with socially-generated collaboration network.…”

Section: Experimentationsmentioning

confidence: 99%

“…These questions have been extensively studied in Collaborative Data Sharing Systems (CDSS) [11], Linked Data with adaptations of DVCS [18,4] and replication techniques [10,25]. Existing approaches follow a total replication approach, i.e., full datasets or their full histories are completely replicated at each participant or they require coordination to maintain consistency.…”

Section: Introductionmentioning

confidence: 99%

Col-Graph: Towards Writable and Scalable Linked Open Data

Ibáñez

Skaf-Molli

Molli

et al. 2014

The Semantic Web – ISWC 2014

View full text Add to dashboard Cite

Abstract. 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 an 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 federated 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 to Linked Data.

show abstract