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 (09:25)
From: Oliver Bandel <oliver@f...>
Subject: Re: [Caml-list] [1/2 OT] Indexing (and mergeable Index-algorithms)
On Thu, Nov 17, 2005 at 09:35:58AM +0100, Florian Hars wrote:
> Oliver Bandel wrote:                                                                                                   
> >It's mainly a question on datastructures/algorithms                                                                   
> I tend to try to find answers to such questions on CiteSeer, maybe you                                                 
> could start at the first paper I found with a quick search:                                                            
> and then look at the papers citing it, or similar to it.                                                               

well, thats, where my further search directed me to. :)

I found an interesting paper there, about using updatable
indexing ("Fast Incremental Indexing for Full-Text Information Retrieval"
from Brown/Callen/Croft.) They talked about "inverted lists",
and this together with other hints from this list may be
a good starter.

> (WARNING: Excessive use of CiteSeer may lead to addiction.)                                                            

Yes, that's true.
I was an addict and hope to get clean, but now google
(and you too) directed me back... ;-)