: Thanks for your answer, you're right, filepathes are pretty much
: unique. Anyway I don't want this total-field-cache-loading situation occur
: in any circumstances - it's too expensive. My app usually crawls while
: user searches are performed. Crawl involves additions and deletions so
: IndexS
On 4/5/06, Artem Vasiliev <[EMAIL PROTECTED]> wrote:
> The int[] array here contains references to String[] and to populate
> it still all the field values need to be loaded and compared/sorted
Terms are stored and iterated in sorted order, so no sorting needs to be done.
It's still the case that
>>I tried to
>> sort by filePath field which can be 100 bytes at average meaning 400M
>> RAM for the cache
YS> For string sorting, a FieldCache.StringIndex is used.
YS> It contains a sorted String[num_unique_terms_in_field], and an int[maxDoc]
YS> So if 10 documents share a large string field valu
Hello Hoss,
Thanks for your answer, you're right, filepathes are pretty much
unique. Anyway I don't want this total-field-cache-loading situation occur
in any circumstances - it's too expensive. My app usually crawls while
user searches are performed. Crawl involves additions and deletions so
Inde
