Co-evolution of RDF Datasets

Faisal, Sidra; Endris, Kemele M.; Shekarpour, Saeedeh; Auer, Sören; Vidal, María-Esther

doi:10.1007/978-3-319-38791-8_13

Cited by 8 publications

(11 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In the last decades, several approaches have been proposed to provide support to the synchronization of semantic stores. 23 In Reference 24, an algorithm proposed to give support for synchronizing semantic data. Semantic data are considered as RDF graphs where each RDF graph is decomposed unequivocally into minimal subsets of triples and canonically represented by ordered lists of the identifiers.…”

Section: Synchronizing Data In the Semantic Webmentioning

confidence: 99%

See 1 more Smart Citation

A conflict‐free replicated data type for collaborative annotation systems

Zarzour

Jararweh

2020

Concurrency and Computation

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: Synchronizing Data In the Semantic Webmentioning

confidence: 99%

“…In the last decades, several approaches have been proposed to provide support to the synchronization of semantic stores 23 . In Reference 24 , an algorithm proposed to give support for synchronizing semantic data.…”

Section: Background and Related Workmentioning

confidence: 99%

A conflict‐free replicated data type for collaborative annotation systems

Zarzour

Jararweh

2020

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…Such a mechanism could also be automated. For example, if a consuming client holds a replica of a source dataset, changes in the source may be propagated to the replica as shown in [51], creating a new version. Updates may also be triggered by events like Git commits, as can be seen in [8].…”

Section: Criterion 151 (Monitoring Of Input Changes: Polling)mentioning

confidence: 99%

“…Therefore, an LDCP should not only allow to export 3* data, but it should support doing so in a user friendly way, with predefined output formats for external tools and, ideally, predefined transformations from vocabularies used in the tool's domain. This observation comes from a recent publication of a Czech registry of subsidies, which was published as LD only, with N-Triples dumps, dereferencable IRIs and a public SPARQL endpoint 51 . This step, while being extremely interesting to semantic web researchers, was received negatively by the Czech open data community, which demanded CSV or JSON files and was not willing to learn RDF and SPARQL.…”

Section: Requirement 29 (Linked Data Platform Output)mentioning

confidence: 99%

Survey of tools for Linked Data consumption

Klímek

Škoda

Nečaský

2019

View full text Add to dashboard Cite

There is lots of data published as Linked (Open) Data (LOD/LD). At the same time, there is also a multitude of tools for publication of LD. However, potential LD consumers still have difficulty discovering, accessing and exploiting LD. This is because compared to consumption of traditional data formats such as XML and CSV files, there is a distinct lack of tools for consumption of LD. The promoters of LD use the well-known 5-star Open Data deployment scheme to suggest that consumption of LD is a better experience once the consumer knows RDF and related technologies. This suggestion, however, falls short when the consumers search for an appropriate tooling support for LD consumption. In this paper we define a LD consumption process. Based on this process and current literature, we define a set of 34 requirements a hypothetical Linked Data Consumption Platform (LDCP) should ideally fulfill. We cover those requirements with a set of 94 evaluation criteria. We survey 110 tools identified as potential candidates for an LDCP, eliminating them in 3 rounds until 16 candidates for remain. We evaluate the 16 candidates using our 94 criteria. Based on this evaluation we show which parts of the LD consumption process are covered by the 16 candidates. Finally, we identify 8 tools which satisfy our requirements on being a LDCP. We also show that there are important LD consumption steps which are not sufficiently covered by existing tools. The authors of LDCP implementations may use this survey to decide about directions of future development of their tools. LD experts may use it to see the level of support of the state of the art technologies in existing tools. Non-LD experts may use it to choose a tool which supports their LD processing needs without requiring them to have expert knowledge of the technologies. The paper can also be used as an introductory text to LD consumption.

show abstract

“…Faisal at al [4] presented an approach to deal with co-evolution, that is, the mutual propagation of the changes between a replica and its origin dataset. Their approach relies on the assumption that either the source dataset provides a tool to compute a changeset at real-time or third party tools can be used for this purpose.…”

Section: Related Workmentioning

confidence: 99%

Framework for Live Synchronization of RDF Views of Relational Data

Vidal

Arruda

Cruz

et al. 2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

This Demo presents a framework for the live synchronization of an RDF view defined on top of relational database. In the proposed framework, rules are responsible for computing and publishing the changeset required for the RDB-RDF view to stay synchronized with the relational database. The computed changesets are then used for the incremental maintenance of the RDB_RDF views as well as application views. The Demo is based on the LinkedBrainz Live tool, developed to validate the proposed framework.

show abstract

Co-evolution of RDF Datasets

Cited by 8 publications

References 16 publications

A conflict‐free replicated data type for collaborative annotation systems

A conflict‐free replicated data type for collaborative annotation systems

Survey of tools for Linked Data consumption

Framework for Live Synchronization of RDF Views of Relational Data

Contact Info

Product

Resources

About