Re: Graphs Design 6.2

Sandro,

I have a few questions about the kinds of problems that you're trying to solve with the named graphs design. My apologies if you have answered them before — I've skipped some of the named graphs threads in the last few weeks.


Let's say I find a couple of TriG files on the Web. This being the Web, I don't trust them fully.

I want to load all of them into my SPARQL store so that I can query them with SPARQL. But I want to load them in a way so that I can still change my mind about what to trust or distrust after having loaded them. So I need to keep track of who said what.

Would you consider this a reasonable thing to do?

(You might answer: No, don't load TriG files that you don't trust! Or you might answer: No, you'd need a more powerful, yet-to-be-developed, query language, which is out of scope for us, if you want to query data across multiple TriG files.)

Assuming you consider it reasonable, then please consider the following sub-cases:

1) I may not fully trust everything that's said in some of the named graphs in these TriG files. (That is, I trust the source of the TriG file and the metadata in the default graphs, but don't trust some of the other sources quoted in the named graphs.)

2) I may not fully trust everything that's said in the default graphs of these TriG files. (For example, the metadata in the default graphs might be horribly outdated, or the TriG files use @union and I don't trust some of the NGs.)

3) I may not fully trust the association between graph IRIs and graphs in some of the TriG files (That is, I suspect they might be lying or mistaken when ascribing statements to certain source IRIs in their named graphs).

Which of these sub-cases must a successful design handle to meet your requirements?

Bonus question: Which of them can be handled by the 6.2 design, and how? You may leave this one as an exercise to the reader of your response — what I really want to know is which of the problems above you want to solve.

Best,
Richard

Received on Wednesday, 25 April 2012 21:33:23 UTC