Re: Reasoning over millions of triples - any working reasoners?

Hi Harry,

AllegroGraph's RDFS++ [1] supports reasoning on owl:sameAs (including
owl:sameAs transitivity and symmetry).  When I tried it out on the 9
million or so owl:sameAs quads in the BTC 2010 data set, it took a
little under 0.10ms per query (on a newish server at Franz Inc.) to
materialize around 190 owl:sameAs statements with a given subject, or
around 0.08ms for 8 statements with another subject.  This is much
larger than a typical owl:sameAs network in the wild (see [2]), so
average query latency should be even less.


Best regards,

Joshua


[1] http://www.franz.com/agraph/support/documentation/v4/reasoner-tutorial.html
[2] http://iswc2010.semanticweb.org/pdf/318.pdf

Messy code dump:  http://pastebin.com/uB8Ak3vQ



-- 
Joshua Shinavier
Tetherless World Constellation PhD student
http://tw.rpi.edu/wiki/Joshua_Shinavier
http://fortytwo.net
+1 509 570 6990



On Wed, Jan 19, 2011 at 3:20 AM, Harry Halpin <hhalpin@ibiblio.org> wrote:
> Everyone,
>
> I've got a big bunch of owl:sameAs statements (about 50 million in
> n-triples) and I want to do some reasoning over them, i.e. look for
> chains of sameAs. Does anyone know of any reasoners that handle that
> amount of data?
>
> I believe there is an EU project on this (Larkc), but I can't get
> WebPIE working over this data-set for some reason, working it through
> with them right now, but I'd like to know if there's any other
> large-reasoners.
>
> Otherwise, I'll just have to write some giant hash-table thing myself
> in Perl, but I'd prefer to try too dogfood it :)
>
>      cheers,
>        harry
>
>

Received on Thursday, 20 January 2011 09:17:27 UTC