Mailing-List: contact java-user-help@lucene.apache.org; run by ezmlm
Precedence: bulk
Reply-To: java-user@lucene.apache.org
Received-SPF: pass (asf.osuosl.org: domain of mike@curtin.com designates
 205.158.62.197 as permitted sender)
Message-ID: <43F7190C.1030901@curtin.com>
Date: Sat, 18 Feb 2006 07:54:36 -0500
From: "Michael D. Curtin" <mike@curtin.com>
User-Agent: Mozilla/5.0 (Windows; U; Windows NT 5.1; en-US;
 rv:1.7.2) Gecko/20040804 Netscape/7.2 (ax)
MIME-Version: 1.0
To: java-user@lucene.apache.org
Subject: Re: Custom Sorting
References: <20060218083907.35025.qmail@web37406.mail.mud.yahoo.com>
In-Reply-To: <20060218083907.35025.qmail@web37406.mail.mud.yahoo.com>
Content-Type: text/plain; charset=us-ascii; format=flowed
Content-Transfer-Encoding: 7bit

SOME ONE wrote:

> Yes, I could run two searches, but that means running
> two searches for each request from user and that I
> think doubles the job taking double time. Any
> suggestions to do it more efficiently please ?

I think it would only take double time if the sets of hit documents have 
substantial overlap, i.e. most of the documents meet both sets of criteria. 
If the sets of documents are mainly disjoint, the time wouldn't matter much 
(since the same index data structures have to be traversed either way).

--MDC

---------------------------------------------------------------------
To unsubscribe, e-mail: java-user-unsubscribe@lucene.apache.org
For additional commands, e-mail: java-user-help@lucene.apache.org