Re: Show me the money - (was Subjects as Literals)

Hello Jeremy!

One example on the top of my head. You have a 'magic predicate' such as
Virtuoso bif:contains, but slightly more expansive than that (a large index
lookup, a difficult mathematical computation or fuzzy literal search, etc).
If you were able to store the result in RDF once that magic predicate had
been triggered once, you would just directly match against the cached
version in further queries. Hence, processing time-- and $++ :)


On 1 Jul 2010 16:37, "Jeremy Carroll" <> wrote:

I am still not hearing any argument to justify the costs of literals as

I have loads and loads of code, both open source and commercial that assumes
throughout that a node in a subject position is not a literal, and a node in
a predicate position is a URI node.

Of course, the "correct" thing to do is to allow all three node types in all
three positions. (Well four if we take the graph name as well!)

But if we make a change,  all of my code base will need to be checked for
this issue.
This costs my company maybe $100K (very roughly)
No one has even showed me $1K of advantage for this change.

It is a no brainer not to do the fix even if it is technically correct


Received on Thursday, 1 July 2010 17:15:59 UTC