Ivan,
Thanks! I will try it right away.
I was just telling Kingsley about the vunit project and that you should join ;)
http://code.google.com/p/vunit/
Regards,
A
On Sat, Oct 17, 2009 at 8:01 PM, Ivan Mikhailov
wrote:
> Aldo,
>
> The attached file contains an efficient procedure that keeps sim
Aldo,
The attached file contains an efficient procedure that keeps simple
cases of graphs with bnodes. First it compares all triples without
bnodes, then it iteratively establishes equivalences between bnodes that
are directly and unambiguously connected to equivalent vertexes by
identical predica
Hello Alan,
That's because our SPARQL lexer remained unchanged since early draft of
SPARQL. My fault. The update to the
http://www.w3.org/TR/2008/REC-rdf-sparql-query-20080115/ rules is in the
attached patch. The patch is also in CVS so it will appear in the next
release of Virtuoso Open Source.
