Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[1/2 OT] Indexing (and mergeable Index-algorithms)
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2005-11-17 (20:42)
From: Oliver Bandel <oliver@f...>
Subject: Re: [Caml-list] [1/2 OT] Indexing (and mergeable Index-algorithms)
On Thu, Nov 17, 2005 at 09:32:44PM +0100, sejourne_kevin wrote:
> Oliver Bandel a écrit :
> >If updates are cheap, then thats the right thing.
> About 1Go an Hour, not depend of the number of docs.

what is  "1Go"?

The update/addition of 10^5 entries in 10^6 entries
must be ready in about 20 minutes (maximum; faster is better).

Creating the first/main index can be hours, that's not
the problem, but updates must be fast.