But you would have to do an expensive computation anyways. The
computation of a diff would have to be done. That means you have to
compare two big datasets somehow.
Input: existing graph G and new set of triple T
For each triple t in T
If !(t in G)
G := G union {t}
For each triple t in G
If !(t in T)
G := G \ {t}
And it becomes more complex once blank nodes occur.
The better way would be to provide incremental changesets by the source.
For example, DBpedia did this some time ago.
On 24.11.2017 13:19, Laura Morales wrote:
>> What about simply deleting the old graph and loading the triples of the
>> .nt file into the graph afterwards? I don't see any benefit of such a
>> "tool" - you could just write your own bash script for this if you need
>> this quite often.
> The advantage is with large graphs, such as wikidata. If I download their
> dumps once a week, it's much more efficient to only change a few triples
> instead of deleting the entire graph and recreating the whole TDB store.
