14 jan 2007 kl. 02.14 skrev Kay Roepke:
If I was you, I would make a filter that navigates an in heap
object graph of all
users and their connections using a breadth first (or perhaps even
A*).
I would essentially have the same problem with a in-memory graph: I
cannot be sure
of the Lucene document ids those users will have, so I would have
to look those up
- exactly as I do now. The bottleneck would remain the same :(
In the original post you mention 2-10 million documents. How much is
that is bytes?
If you can fit it in RAM, I think that http://issues.apache.org/jira/
browse/LUCENE-550
could be your friend. It keeps each document as an instance in
memory. Extend the
InstantiatedIndexDocument class with an association to the user
owning the document.
I wrote the index for this particular case where I due to very heavy
load needed to
retreive some 100,000 aggregated class instances per second, based on
a field value.
--
karl
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
