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:02)
From: Oliver Bandel <oliver@f...>
Subject: Re: [Caml-list] [1/2 OT] Indexing (and mergeable Index-algorithms)
On Thu, Nov 17, 2005 at 07:50:13PM +0100, sejourne_kevin wrote:
> Oliver Bandel a écrit :
> >Any hints here?
> >(Maybe using OCaml, but the imperative features of it would help,
> > if the functional features would be too slow?)
> >
> >Any hint on algorithms/datastructures for this would be fine...
> >
> In my work we use "Lucene" ( Lucene is in java but have been 
> re-coded in few other langage (c++,python...), the spec of the infex 
> format is availble for free (online).
> I think the real problem for 10^x (x > 6) docs is the size of the index, 
> not really the speed of the answer(not for lucene (fast and small)).

The size of the index as well as creating time of it.
If it's not updateble and must be created new for every
update, than this needs to much time.

If updates are cheap, then thats the right thing.