1

I wonder if there is a straight forward recipe to do what reification was supposed to do, but in a way which is SPARQL-friendly, and if possible without using named graphs.

flag
1 
 Just found [esw.w3.org/topic/…) quite interesting. – Laurian Gridinoc Nov 8 at 13:23

1 Answer

1

Most SPARQL-friendly would certainly be named graphs, because they actually developed from SPARQL.

link|flag
I was wondering how to do it without named graphs as I don't know at import time what should be split into graphs. – Laurian Gridinoc Nov 8 at 13:22
I would be able to help you better if you provided some example use case. Why you want to split up things? – Jiří Procházka Nov 8 at 20:03

Your Answer

Get an OpenID
or

Not the answer you're looking for? Browse other questions tagged or ask your own question.