Hello,
I love this procedure, it has been very useful to test transformations
from one graph to another.
Although sometimes its not so easy (for me) to interpret the resulting
graph differences, I think that is direct to adjust the output.
Thank you very much!
Cristian.
On Sat, Oct 17, 2009 at
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
Hi Ivan,
On Sun, Oct 11, 2009 at 3:50 AM, Ivan Mikhailov
wrote:
> Hello Aldo,
>
> Yes, some low-level tricks could be possible. But it depends on two
> things.
>
> 1) What are sizes of graphs in question?
Initially they will be small. 1000 triples or less.
I want to use this for a minimalistic u
Hello Aldo,
Yes, some low-level tricks could be possible. But it depends on two
things.
1) What are sizes of graphs in question?
2) With BNodes, what's the needed criterion to decide wither two BNodes
are equivalent?
Best Regards,
Ivan Mikhailov
OpenLink Software
http://virtuoso.openlinksw.com
Hi,
What would be a PERFORMANT way of testing graph equality for two
graphs in the Quad store?
* A: without BNodes
* B: with BNodes
I am now using SPARUL and temp graphs to generate a diff, but I
imagine there is a better way ( using low level APIs perhaps? ).
Regards,
A
--
Aldo Bucchi
skype:a
