W3C home > Mailing lists > Public > semantic-web@w3.org > January 2011

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

From: Barry Bishop <barry.bishop@ontotext.com>
Date: Wed, 19 Jan 2011 11:45:00 +0100
Message-ID: <4D36C0AC.9030502@ontotext.com>
To: Harry Halpin <hhalpin@ibiblio.org>
CC: Semantic Web <semantic-web@w3.org>
Hello Harry,

BigOWLIM can handle billions of statements and has specific 
optimisations for owl:sameAs. It is packaged as a SAIL for Sesame, but 
can also be used with Jena.

It is a commercial product, but free for research and evaluation. If you 
are interested, go to http://www.ontotext.com/owlim/index.html and click 
'get BigOWLIM' at the bottom of the page. Please fill in all the boxes 
(to save time asking the same questions again) and fairly soon you 
should receive a download link.

I hope this helps,

Barry Bishop
OWLIM Product Manager
Ontotext AD
Tel: +43 650 2000 237
email: barry.bishop@ontotext.com

On 18/01/11 20:20, Harry Halpin 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 Wednesday, 19 January 2011 10:45:36 UTC

This archive was generated by hypermail 2.4.0 : Tuesday, 5 July 2022 08:45:22 UTC