[prev in list] [next in list] [prev in thread] [next in thread]
List: lucene-dev
Subject: Re: BitSet implementation and large index
From: Daniel Naber <daniel.naber () t-online ! de>
Date: 2005-02-14 19:07:11
Message-ID: 200502142007.11652 () danielnaber ! de
[Download RAW message or body]
On Monday 14 February 2005 16:29, tony@simpleobjects.com wrote:
> It seems that for a huge index, it might be a good idea to use a
> different implementation of the BitSet when doing filtering (assuming
> the non-filtered set is relatively small). This would really help
> minimize the memory required for each filter operation.
This already exists:
http://issues.apache.org/bugzilla/show_bug.cgi?id=32921
Regards
Daniel
--
http://www.danielnaber.de
---------------------------------------------------------------------
To unsubscribe, e-mail: lucene-dev-unsubscribe@jakarta.apache.org
For additional commands, e-mail: lucene-dev-help@jakarta.apache.org
[prev in list] [next in list] [prev in thread] [next in thread]
Configure |
About |
News |
Add a list |
Sponsored by KoreLogic