W3C home > Mailing lists > Public > www-rdf-interest@w3.org > August 2000

Re: Announcing RDFdb

From: Guha <guha@guha.com>
Date: Fri, 18 Aug 2000 11:29:38 -0700
Message-ID: <399D8092.1F5CBD74@guha.com>
To: Ross Judson <ross@ManagedObjects.com>
CC: Sergey Melnik <melnik@DB.Stanford.EDU>, www-rdf-interest@w3.org
I hope to have something to publish soon.

As far as in-memory stores go, the best is the one
in http://lxr.mozilla.org/seamonkey/source/rdf/opendir/

Its *really* fast and flexible. The epinions.com backend
is based on that and does just fine with over 10 million
triples.

guha

Ross Judson wrote:

> Can you supply any references for this material?  I have implemented an
> in-memory RDF store based on an ordered tree, but have not yet examined
> hash-based approaches.
>
> ----- Original Message -----
> From: "Guha" <guha@guha.com>
> To: "Sergey Melnik" <melnik@DB.Stanford.EDU>
> Cc: <www-rdf-interest@w3.org>
> Sent: Friday, August 18, 2000 1:22 PM
> Subject: Re: Announcing RDFdb
>
> >  The indexes are currently built on b-trees provided by Sleepycat.
> >  I am working on a "nested hash" structure which is more appropriate
> > for graphs. The "join algorithm" is fairly straightforward and
> > only uses conjunct ordering for optimization. I plan to implement
> > a lot of the optimizations used in cyc, lore, etc.
> >
Received on Friday, 18 August 2000 14:30:34 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Monday, 7 December 2009 10:51:44 GMT