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

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

From: Adrian Walker <adriandwalker@gmail.com>
Date: Tue, 18 Jan 2011 15:35:27 -0500
Message-ID: <AANLkTim_++H6BOv+MpK5Yny38GwGP_Be6hzVcT4yNeYY@mail.gmail.com>
To: Harry Halpin <hhalpin@ibiblio.org>
Cc: semantic-web@w3.org
Hi Harry,

Just out of curiosity, what is the application that requires this kind of
reasoning over 50 million triples?

                Thanks,  -- Adrian

Internet Business Logic
A Wiki and SOA Endpoint for Executable Open Vocabulary English Q/A over SQL
and RDF
Online at www.reengineeringllc.com
Shared use is free, and there are no advertisements

Adrian Walker
Phone: USA 860 830 2085

On Tue, Jan 18, 2011 at 2:20 PM, 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 Tuesday, 18 January 2011 20:36:12 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 19:48:20 UTC