Hi,
I have a question related to faceted search. My index contains more than 1
million documents, and nearly 1 million terms. My aim is to get a DocIdSet
for each term occurring in the result of a query. I use the approach
described on
http://sujitpal.blogspot.com/2007/04/lucene-search-within-sear
et per term is very sparse, BitSet is probably not a good
> representation. Simple int array maybe better for memory, and faster for
> iterating.
>
> -John
>
> On Mon, Oct 12, 2009 at 8:45 AM, Paul Elschot >wrote:
>
> > On Monday 12 October 2009 14:53:45 Christoph Boo
decline in performance.
Now I know it's nothing abnormal, at least.
Chris
2009/10/12 Jake Mannix
> Hey Chris,
>
> On Mon, Oct 12, 2009 at 10:30 AM, Christoph Boosz <
> christoph.bo...@googlemail.com> wrote:
>
> > Thanks for your reply.
> > Yes, it's li
ng
> time, and add the termvectors for the matching docs into a
> (large) map of terms in RAM.
>
> Regards,
> Paul Elschot
>
>
> On Monday 12 October 2009 21:30:48 Christoph Boosz wrote:
> > Hi Jake,
> >
> > Thanks for your helpful explanation.
> > In f
Ok, I will have a shot at the ascending docId order.
Chris
2009/10/13 Paul Elschot
> On Monday 12 October 2009 23:29:07 Christoph Boosz wrote:
> > Hi Paul,
> >
> > Thanks for your suggestion. I will test it within the next few days.
> > However, due to memory limita
