On 5-Nov-07, at 2:22 PM, Charles Hornberger wrote:
> On 11/5/07, Charles Hornberger
<charles.hornberger gmail.com> wrote:
>> Also, it seems a bit inefficient to bother
allocating an array
>> containing an entry for each document when only
some small percentage
>> of the documents actually contain values for the
field. Would it be
>> worth investigating whether you could somehow avoid
this to save some
>> RAM?
>
> To clarify: I'm suggesting that *I* would do the
investigating here,
> not someone else ... I'm
just wondering if it's even worth trying
> ....
Perhaps something to bring up on java-dev (lucene)? I think
someone
once implemented a solution using hashmaps for sorting, but
I can't
recall the issue #.
-Mike
|