Follow-up questions below denoted with --
Thanks,
Zach
-Original Message-
From: Erik Hatcher [mailto:[EMAIL PROTECTED]
Sent: Wednesday, August 31, 2005 12:25 PM
To: java-user@lucene.apache.org
Subject: Re: Ideal Index Fragmentation
On Aug 30, 2005, at 9:53 PM, Friedland, Zachary (EDS
: --OK, is there a preferred strategy for generating lists of distinct
: attributes in the hit[]? I've seen Hoss' post about using QueryFilters,
: but that assumes that you know what values you want to count; but I
: won't know the domain of values to expect in every field... Can I get
:
On Aug 30, 2005, at 9:53 PM, Friedland, Zachary (EDS - Strategy) wrote:
* I'm interested in implementing a dynamic filter component
that will walk through the hits[] object and pull out distinct
values for certain fields to display as search-within-a-search
options (all of them will
On Aug 30, 2005, at 9:53 PM, Friedland, Zachary (EDS - Strategy) wrote:
More assorted questions:
*I have been reading the posts on using Filter vs.
BooleanQuery. To implement a search-within-a-search, it seems the
Filter is advantageous due to its cacheability, but are there other
Does anyone have experience using lots of indexes simultaneously with
the multisearcher? I'm looking to index 15 distinct objects for
searching, and was thinking of creating 15 distinct indexes for better
manageability performance (for certain searches when I know which
index to search).
Zach,
It probably won't help performance to split the index and then search
it on the same machine unless you search the indexes in parallel (with
a multiprocessor or multi-core machine). Even in this case, the disk
is often a bottleneck, essentially preventing the search from really
running in
:
Subject: Re: Ideal Index Fragmentation
Zach,
It probably won't help performance to split the index and then search
it on the same machine unless you search the indexes in parallel (with
a multiprocessor or multi-core machine). Even in this case
