Return-Path: Delivered-To: apmail-lucene-java-user-archive@www.apache.org Received: (qmail 27668 invoked from network); 2 Sep 2005 13:31:46 -0000 Received: from hermes.apache.org (HELO mail.apache.org) (209.237.227.199) by minotaur.apache.org with SMTP; 2 Sep 2005 13:31:46 -0000 Received: (qmail 50313 invoked by uid 500); 2 Sep 2005 13:31:40 -0000 Delivered-To: apmail-lucene-java-user-archive@lucene.apache.org Received: (qmail 50291 invoked by uid 500); 2 Sep 2005 13:31:40 -0000 Mailing-List: contact java-user-help@lucene.apache.org; run by ezmlm Precedence: bulk List-Help: List-Unsubscribe: List-Post: List-Id: Reply-To: java-user@lucene.apache.org Delivered-To: mailing list java-user@lucene.apache.org Received: (qmail 50278 invoked by uid 99); 2 Sep 2005 13:31:40 -0000 Received: from asf.osuosl.org (HELO asf.osuosl.org) (140.211.166.49) by apache.org (qpsmtpd/0.29) with ESMTP; Fri, 02 Sep 2005 06:31:40 -0700 X-ASF-Spam-Status: No, hits=0.0 required=10.0 tests= X-Spam-Check-By: apache.org Received-SPF: pass (asf.osuosl.org: local policy) Received: from [199.43.38.100] (HELO mlnya402er.ml.com) (199.43.38.100) by apache.org (qpsmtpd/0.29) with ESMTP; Fri, 02 Sep 2005 06:31:52 -0700 Received: from MLNYB853BH.amrs.win.ml.com (unknown [146.125.94.131]) by mlnya402er.ml.com (Postfix) with ESMTP id 598FDF0000E8 for ; Fri, 2 Sep 2005 09:31:35 -0400 (EDT) Received: from mlnya301bh.amrs.win.ml.com ([146.125.109.51]) by MLNYB853BH.amrs.win.ml.com with Microsoft SMTPSVC(5.0.2195.6713); Fri, 2 Sep 2005 09:31:26 -0400 Received: from mlnyb706mb.amrs.win.ml.com ([146.125.92.6]) by mlnya301bh.amrs.win.ml.com with Microsoft SMTPSVC(5.0.2195.6713); Fri, 2 Sep 2005 09:31:26 -0400 X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2800.1506 Content-Class: urn:content-classes:message MIME-Version: 1.0 Content-Type: text/plain; charset="US-ASCII" Content-Transfer-Encoding: quoted-printable Importance: normal Priority: normal Subject: RE: Ideal Index Fragmentation Date: Fri, 2 Sep 2005 09:31:26 -0400 Message-ID: <82D2BB25EFABA3478B75FF11C88148D518D9053B@mlnyb706mb.amrs.win.ml.com> X-MS-Has-Attach: X-MS-TNEF-Correlator: Thread-Topic: Ideal Index Fragmentation thread-index: AcWuSIuktcoL1pqwRUeDwefx96xSYABeSZ0Q From: "Friedland, Zachary (EDS - Strategy)" To: X-OriginalArrivalTime: 02 Sep 2005 13:31:26.0535 (UTC) FILETIME=[9E5D2D70:01C5AFC2] X-Virus-Checked: Checked by ClamAV on apache.org X-Spam-Rating: minotaur.apache.org 1.6.2 0/1000/N Follow-up questions below denoted with "--" Thanks, Zach -----Original Message----- From: Erik Hatcher [mailto:erik@ehatchersolutions.com]=20 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 - Strategy) wrote: >> More assorted questions: >> >> * I have been reading the posts on using Filter vs. =20 >> BooleanQuery. To implement a search-within-a-search, it seems the =20 >> Filter is advantageous due to its cacheability, but are there other =20 >> pros or cons that should be considered (memory, speed, etc). >It's only advantageous when the Filters are long-lived over multiple =20 >searches. It's not really recommended for search-within-search when =20 >the initial search is transient. Combining queries within a =20 >BooleanQuery is more recommended in that case. --Great! This one is closed down... >> * I'm interested in implementing a "dynamic filter" component =20 >> that will walk through the hits[] object and pull out distinct =20 >> values for certain fields to display as search-within-a-search =20 >> options (all of them will return at least one result since they are =20 >> in the hits[]). Has anyone implemented something like this -- how =20 >> did it work out? >Walking all Hits and extracting a field is an expensive operation, so =20 >be forewarned on that. --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 creative with the hitsCollector to solve this one? >> * When using a ParallelMultiSearcher, is there an easy way to =20 >> know how many matches came from each index searched? I'd like to =20 >> be able to display how many of each object are in the combined hits=20 >> []. Since I'm storing one object type per index, the count of hits =20 >> from each index will give me that number. >I'm not sure if you can get at each indexes results in that way, but =20 >you can tell which index an individual hit came from (see API docs =20 >for details on that). --Has anyone else hacked the ParallelMultisearcher to do something like a hits.length before recombining them? >> * 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 =20 >still left to be done for a 1.9 release. I haven't heard any prods =20 >to release it any time soon, but you're welcome to push us to =20 >consider it if need be. > Erik --------------------------------------------------------------------- To unsubscribe, e-mail: java-user-unsubscribe@lucene.apache.org For additional commands, e-mail: java-user-help@lucene.apache.org -------------------------------------------------------- If you are not an intended recipient of this e-mail, please notify the = sender, delete it and do not read, act upon, print, disclose, copy, = retain or redistribute it. Click here for important additional terms = relating to this e-mail. http://www.ml.com/email_terms/ -------------------------------------------------------- --------------------------------------------------------------------- To unsubscribe, e-mail: java-user-unsubscribe@lucene.apache.org For additional commands, e-mail: java-user-help@lucene.apache.org