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 On Sun, 2009-10-11 at 02:07 -0300, Aldo Bucchi wrote: > 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 >
