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
pros or cons that should be considered (memory, speed, etc).
It's only advantageous when the Filters are long-lived over multiple
searches. It's not really recommended for search-within-search when
the initial search is transient. Combining queries within a
BooleanQuery is more recommended in that case.
* 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 return at least one result since they are
in the hits[]). Has anyone implemented something like this -- how
did it work out?
Walking all Hits and extracting a field is an expensive operation, so
be forewarned on that.
* When using a ParallelMultiSearcher, is there an easy way to
know how many matches came from each index searched? I'd like to
be able to display how many of each object are in the combined hits
[]. Since I'm storing one object type per index, the count of hits
from each index will give me that number.
I'm not sure if you can get at each indexes results in that way, but
you can tell which index an individual hit came from (see API docs
for details on that).
* Does anyone know when 1.9/2.0 will be released?
Your guess is as good as any at this point. I'm not sure what is
still left to be done for a 1.9 release. I haven't heard any prods
to release it any time soon, but you're welcome to push us to
consider it if need be.
Erik
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
