barthanssens on develop
GH-3125: upgrade commons io and… (compare)
Models.isSubsetcan be used to implement graph diff.
@aucampia it kind of depends what exactly you mean with "difference" in the context of RDF models. For example, consider these two models:
:a :p _:b1 . _:b1 :q :z .
:a :p _:b2 . _:b2 :q :z .
Are those different, in your opinion? They're not equal, but they are isomorphic under blank nodes mapping. And what about this one:
:a :p _:b1 , _:b2. _:b1 :q :z . _:b2 :q :z.
Not structurally isomorphic with the the first or the second, but semantically isomorphic (it can be leaned).
GraphComparisons. We use the notion of an "iso-canonical blank node mapping". I haven't tried myself yet but it should be doable to use that mapping to come up with a meaningful way to determine the difference between two graphs.
Pretty off topic, but can anyone here point me to an online community for some sparring about RDF lists and blank nodes?
I have an application that I want to migrate to RDF (currently on PostgreSQL with vertically partitioned fact/property tables). There are some structures in the schema with lists of 'tagged strings' (pertaining to names and addresses) that cause me too but heads with RDF lists, blank nodes, etc. I tried stackoverflow, but got little response.