I haven't tried it, but I think the fix should be easy... never throw
that exception. Either check for null before the loop, or in the
loop.
Original code for native int sorting:
TermEnum termEnum = reader.terms (new Term (field, ));
try {
if (termEnum.term() == null)
Hi Everyone,
The company I work for uses Lucene search 2 of their sites. Each site's
configuration is (almost) an mirror image of the other. The only difference
here is the content. We use a servlet to start up a Lucene mantainance
utility that keeps the indexes up to date. This servlet is set to
-Oorspronkelijk bericht-
Van: Roy Klein [mailto:[EMAIL PROTECTED]
Verzonden: donderdag 14 april 2005 15:40
Aan: java-user@lucene.apache.org
Onderwerp: Update performance/indexwriter.delete()?
I've got an application that will be doing
constant updates to an index.
I've looked into
Hello all,
I would like to get the following information from the index:
1. Given a term, how many times the term occurs in each document.
Something like a triple:
Term, Doc1, Freq , Term, Doc2, Freq, Term2, Docx, Freq, ...
Is possible to do that?
Regards,
Pablo
--
Pablo Gomes Ludermir
Hi,
From: Pablo Gomes Ludermir [mailto:[EMAIL PROTECTED]
I would like to get the following information from the index:
1. Given a term, how many times the term occurs in each document.
Something like a triple:
Term, Doc1, Freq , Term, Doc2, Freq, Term2, Docx, Freq, ...
Is possible to
Le 14 avr. 05, à 17:15, Pablo Gomes Ludermir a écrit :
I would like to get the following information from the index:
1. Given a term, how many times the term occurs in each document.
Something like a triple:
Term, Doc1, Freq , Term, Doc2, Freq, Term2, Docx, Freq, ...
Is possible to do that?
Luke
Hi,
I am currently evaluating the need for an elaborate query
data-structure (to be exchanged over XML-RPC) as opposed to working
with plain strings.
One thing that would heavily vote for strings would be to have query
objects returned by Query-parser reconvertible to a string (and
On Thursday 14 Apr 2005 15:15, Pablo Gomes Ludermir wrote:
Hello all,
I would like to get the following information from the index:
1. Given a term, how many times the term occurs in each document.
Something like a triple:
Term, Doc1, Freq , Term, Doc2, Freq, Term2, Docx, Freq, ...
Is
Paul Smith wrote:
So it sounds like there isn't a perfect solution, but I think the best
tradeoff for me is to put them all in the same position unless
anyone has more input on the subject?
If they're all at the same position you can still use slop to match the
phrase. So if 'power', 'query'
On Apr 14, 2005, at 11:32 AM, Paul Libbrecht wrote:
Hi,
I am currently evaluating the need for an elaborate query
data-structure (to be exchanged over XML-RPC) as opposed to working
with plain strings.
One thing that would heavily vote for strings would be to have query
objects
An IndexReader is required to, given a term, find the document number to
mark deleted.
Yeah, most the time it makes sense to do deletions off the
IndexReader. There are times, however, when it would be nice for
deletes to be able to be concurrent with adds.
Q: can docids change after an add()
Paul Libbrecht wrote:
I am currently evaluating the need for an elaborate query data-structure
(to be exchanged over XML-RPC) as opposed to working with plain strings.
I'd opt for both. For example:
search
boolean-query
required
query-parser analyzer=...java based
Hi,
I guess I didn't ask my question very well. I do understand that you can
only do a delete via a reader based on the current sources, what I don't
understand is why the delete function couldn't be incorporated into a
writer, so that updates could be all done within the context of a writer?
Roy Klein wrote:
I think this is a better way of asking my original questions:
Why was this designed this way?
In order to optimize updates.
Can it be changed to optimize updates?
Updates are fastest when additions and deletions are separately batched.
That is the design.
Doug
On Thursday 14 April 2005 16:44, Luis Medina wrote:
primarily reporting lock issues (except no lock files
were found in the directory).
With that directory, do you mean the index directory? The lock files are
not there, but in /tmp (by default). It's only okay to remove the lock
file
I have a bunch of documents in my index, some of which have values for a
certain field while others don't. I'd like the ones that do have a value
to always show up before the ones who don't when sorting by relevance.
I tried to accomplish this by check whether there are values for the
field, and
I've got the book (which is great, btw). I used Luke to get explanations
of the results, but I don't see any boosts in the explanations.
Martin
On Thu, 2005-04-14 at 13:24 -0700, Otis Gospodnetic wrote:
I'd look a the output of Explain to see how ranking score is calculated
Look at this:
On Apr 14, 2005, at 4:32 PM, Martin May wrote:
I've got the book (which is great, btw). I used Luke to get
explanations
of the results, but I don't see any boosts in the explanations.
The index-time boosts are folded into the field normalization factor,
so you won't see boost by itself. That
On Thursday 14 April 2005 16:28, Yonik Seeley wrote:
I haven't tried it, but I think the fix should be easy... never throw
that exception.
As Lucene does not have the concept of a warning I think it should throw
exceptions when someone tries to do something that doesn't make sense
(even if
19 matches
Mail list logo
