> From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]]
>
> What happens to the document numbers when documents are
> deleted and the
> segment merged?
> Is the document number of all the documents reset to be
> sequential based
> on some offset for each segment?
>
> Is there any pattern that m
What happens to the document numbers when documents are deleted and the
segment merged?
Is the document number of all the documents reset to be sequential based
on some offset for each segment?
Is there any pattern that might be followed instead of recreating the
entire array. I know this prob
> From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]]
>
> I think this still works if the the document number continue
> to increase
> by one when documents are added incrementally.
> Does anyone know if this is true (I haven't looked at the code yet).
Yes, that is true, so long as you do not d
m: Doug Cutting [mailto:[EMAIL PROTECTED]]
> Sent: Friday, November 16, 2001 5:47 PM
> To: 'Lucene Users List'
> Subject: RE: Sorting Options for Query Results
>
>
> This is not easy to do efficiently. The efficiency of the search code
> depends on not constructing
gards,
Jeff
-Original Message-
From: Doug Cutting [mailto:[EMAIL PROTECTED]]
Sent: Friday, November 16, 2001 5:47 PM
To: 'Lucene Users List'
Subject: RE: Sorting Options for Query Results
This is not easy to do efficiently. The efficiency of the search code
depends on not constr
Hi again :)
Hits versus HitCollector
I implemented HitCollector, but it didn't seem much faster. I'm
guessing its because Hits doesn't seem to run all the way through the
resultset before finishing whereas HitsCollector does ?
So, What I'd really like to know, is, does a Hits combined
Hi,
I was wondering why reader.document(i) is relatively slow ? Given
that it is, perhaps could anyone tell me if this would be work?
I'm currently trying to create a fast lookup, and the reader.doc(i)
is quite slow.
Question -- could I create this an array in the insertion order at
In
This is not easy to do efficiently. The efficiency of the search code
depends on not constructing Document objects for every match. Thus it is
hard to efficiently perform calculations which require field values.
Things are easy if you need date order, and you have added documents in date
order.
On Fri, 16 Nov 2001, Jeff Kunkle wrote:
> Hello. Does anyone know of a way to sort search results other than by
> score? It seems like it would be very useful to be able to sort by
> date or maybe even by any field that has been indexed (which I guess
> would include a date). From what I can t
