Mailing-List: contact java-user-help@lucene.apache.org; run by ezmlm
Precedence: bulk
Reply-To: java-user@lucene.apache.org
Received-SPF: pass (herse.apache.org: domain of hilton.campbell@gmail.com
 designates 64.233.162.232 as permitted sender)
DomainKey-Signature: a=rsa-sha1; c=nofws;
        d=gmail.com; s=beta;
        h=received:message-id:date:from:to:subject:mime-version:content-type;
        b=smIzsycH7G/5n7ANBqUxAVevNWwQnQZ3pSmiJ4g3cl/foKX4521dSR08Gu0MFOMpQZysf5MhAqb72LeC3UP5B7ucYXyU4ivnGVSC/fQKFIhNmXwqAm5MxvVO5ZPUKSvYL3Fh5lo9p6IEUSQfrBXEnE2eHs4Ur89DLfp2rQ3YcfI=
Message-ID: <8d6059bb0706051104o32fd328ci42a8744db959f44c@mail.gmail.com>
Date: Tue, 5 Jun 2007 12:04:33 -0600
From: "Hilton Campbell" <hilton.campbell@gmail.com>
To: java-user@lucene.apache.org
Subject: How can I search over all documents NOT in a certain subset?
MIME-Version: 1.0
Content-Type: multipart/alternative;
	boundary="----=_Part_26638_21808257.1181066673812"

------=_Part_26638_21808257.1181066673812
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit
Content-Disposition: inline

Hello all,

In my application I want to perform a search over all the documents that are
NOT in a certain subset, and I'm not sure how I should do it.

Specifically, the application performs a search and the top N results are
shown to the user.  The user may then opt to see the next top N results.  By
the time the user chooses to see the next N results, however, there may be
new, highly-relevant documents in the index (as indexing is occurring
concurrently).  So instead of just skipping to the next N, I need to perform
a new search and get the top N that haven't been seen yet.  Is anyone aware
of an efficient way to implement this?

I can think of at least one way: I can keep track of the documents that have
been seen and iterate through all the hits, skipping those that have already
been seen.  I just want to see if there isn't a better way that doesn't
iterate through potentially hundreds of already seen hits, or if anyone has
any pointers on an efficient implementation of this idea.

Thanks!
Hilton Campbell

------=_Part_26638_21808257.1181066673812--