-
We are starting a new project (in the Digital Humanities) and we are currently evaluating backend solutions to use. The project will be mainly about pulling data from various resources and harmonizing/linking these datasets. We have been using triplestores for these tasks before (blazegraph, jena fuseki, graphdb), but have always made extensive use of named graphs (to keep provenance data of the source datasets).
|
Beta Was this translation helpful? Give feedback.
Replies: 4 comments 8 replies
-
@sennierer Yes, named graphs are on our agenda. And yes, there are alternatives to realizing named graphs with the current version of QLever. How large is your dataset and can you provide a link to it? Then we could have a concrete look and maybe provide a concrete solution right away. |
Beta Was this translation helpful? Give feedback.
-
we have the same challenge in PHAROS. So any suggestions are very appreciated. In my view there are two main use cases for named graphs, one to track provenance and second to query datasets separately or in different combination. Unfortunately, as I understand it, the later use case can't be currently address with QLever, as I outlined it here #493 (comment) . Where with named graphs one can simply use
@hannahbast Is there any alternative way to do it with QLever? @sennierer For provenance use case, we decided to maintain provenance for every RDF triple in the database using |
Beta Was this translation helpful? Give feedback.
-
Since you're also working with Wikidata, it might be interesting to use Wikidata-style reification (two-part predicates and qualifiers). |
Beta Was this translation helpful? Give feedback.
-
@joka921 with PR #1444 merged, there is now a NQuad parser and it seems to work. However, the sparql server doesn't support the |
Beta Was this translation helpful? Give feedback.
@sennierer We currently have the NAMED Graph support under active development.
There already is a working PR for adding the Graph IRI of each triple to QLever's index structures (#1337), And I am currently working on an NQUAD parser. What conceptually is still missing is the usage of the Graph IRI with the appropriate queries, but that is on my list. So something like weeks (to a working prototype) to a few months (until it can be merged and is usable) sounds reasonable to expect.
As for your second suggestion concerning the FILTER: In principle this can be done and this is also somewhere on our list. We already have efficient binary search filters for Prefixes, but currently your would b…