Mailing-List: contact lucene-user-help@jakarta.apache.org; run by ezmlm
Precedence: bulk
Reply-To: "Lucene Users List" <lucene-user@jakarta.apache.org>
Content-class: urn:content-classes:message
MIME-Version: 1.0
Content-Type: multipart/alternative;
	boundary="----_=_NextPart_001_01C46E1A.504F7FA6"
Subject: Post-sorted inverted index?
Date: Tue, 20 Jul 2004 00:27:56 -0500
Message-ID: 
 <F36CECB25A260542A3FD097C50B1EA3C03FD2A@mailbe04.mc.vanderbilt.edu>
Thread-Topic: Post-sorted inverted index?
Thread-Index: AcRuGlA+6zeC1zaVQU2Vc7JordwLmg==
From: "Aphinyanaphongs, Yindalon" <ping.pong@Vanderbilt.Edu>
To: <lucene-user@jakarta.apache.org>

------_=_NextPart_001_01C46E1A.504F7FA6
Content-Type: text/plain;
	charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable

I gather from reading the documentation that the scores for each =
document hit are computed at query time.  I have an application that, =
due to the complexity of the function, cannot compute scores at query =
time.  Would it be possible for me to store the documents in pre-sorted =
order in the inverted index? (i.e. after the initial index is created, =
to have a post processing step to sort and reindex the final documents).
=20
For example:
Document A - score 0.2
Document B - score 0.4
Document C - score 0.6
=20
Thus for the word 'the', the stored order in the index would be C,B,A.
=20
Thanks!

------_=_NextPart_001_01C46E1A.504F7FA6--