Task 1

Task 1: Accessibility-oriented Knowledge Graphs


This task intends to build an accessible SPARQL distributed datastore for DeKaloG. Thanks to web preemption, we demonstrated how it is possible to provide fair access policies to KGs and get complete results for queries. The scientific challenge is now to demonstrate how web preemption can scale with a big volume of data and a large number of concurrent queries including update queries.

Research report “Web preemption and SPARQL update” D.1.1GDDT0+14
Research report  “Web Preemption over distributed datastore”D.1.2GDD, DBT0+28
Research report “Benchmarking”D1.3GD, WimmicsT0+35

Partner’s contribution: Leader: GDD. Participants: Wimmics, BD

Methods and technical decisions

  • Many distributed datastores can be used for storage. We have to study the compatibility of existing datastores: Cassandra, RocksDB, Aerospike, HBase etc. with the requirement of web preemption in terms of constant access time to the data. Once compatible datastores are chosen, we have to evaluate their performances using existing SPARQL benchmarks. The best performance will be chosen for the development of an accessible, scalable and updatable SPARQL server.

Risks and fallbacks

  • GDD team has experience in Read-Write Linked Data and consistency criteria for SPARQL 1.1 Updates [11]. This reduces the risk related to the Update.
  • Providing an accessible store based on web preemption is crucial for DeKaloG. However, GDD team has a robust implementation of Web preemption thanks to the Sage software available at http://sage.univ-nantes.fr

Comments are closed.