Browse thread
[1/2 OT] Indexing (and mergeable Index-algorithms)
-
Oliver Bandel
- skaller
-
Florian Hars
- Oliver Bandel
- Florian Weimer
- Oliver Bandel
- Oliver Bandel
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
| Date: | -- (:) |
| 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:
> http://citeseer.ist.psu.edu/cutting90optimizations.html
> 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... ;-)
Ciao,
Oliver