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

Re: Announcing RDFdb

From: Ross Judson <ross@ManagedObjects.com>
Date: Fri, 18 Aug 2000 14:15:18 -0400
Message-ID: <00df01c00940$43efcd80$221a37ce@mosol.com>
To: <guha@guha.com>, "Sergey Melnik" <melnik@DB.Stanford.EDU>
Cc: <www-rdf-interest@w3.org>
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:16:51 GMT

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