[sorry for the long delay for my answer, we are having some issues with our
mail server...]
Thanks for your comment. Yes it would make sense if the log files were not
so big. In fact, I'm only indexing a subset of the log information.
Because I store the information in Lucene, it is easier and f
[sorry for the long delay for my answer, we are having some issues with our
mail server...]
Thanks for your comment. Yes it would make sense if the log files were not
so big. In fact, I'm only indexing a subset of the log information.
Because I store the information in Lucene, it is easier and f
age-
From: Mike Klaas [mailto:[EMAIL PROTECTED]
Sent: Friday, October 20, 2006 5:00 PM
To: java-user@lucene.apache.org
Subject: Re: "Catalog" backend for document stored fields?
On 10/20/06, Robichaud, Jean-Philippe
<[EMAIL PROTECTED]> wrote:
> 3- Any ideas on how
Hello to all of you!
I'm using Lucene to index millions a relatively small documents. In fact,
I'm indexing logs from a transaction-based application. Each document
represents what happened inside during 'transaction'. Each of them is
composed by 5-6 main 'states' which are themselves compos
Hi Everyone,
I have a special scenario where I frequently want to insert duplicates
documents in the index. For example, I know that I want 400 copies of the
same document. (I use the docboost of something else so I can't just add one
document and set the docboost to 400).
I would like to hac
Hi everyone.
I need a special query type that looks like a phrase query but with special
logic inside (like allowing inversions of certain terms only and not of
others, special score manipulation on certain 'events', ...) I wonder what
approach I should take? How does someone build a custom q
Hi Everyone.
I'm currently in a situation where I have multiples indexSearcher opened at
the same, each on different indices. They are kept inside a
"IndicesManager" that export getSearcherAtLocation/FreeSearcher method. I
would like to be able to log the "path" used by a searcher I'm about to
"c
It may be simpler and more effective to use the Hits object and keep the
number of time each host was actually "returned" to the user and skip it if
the limit has been reach. This way, if your users just look at the 10-20
highest hits, you will save you a lot of processing time, especially if you
Ok, I know that usually, the scores returned by Lucene do not mean "really"
something. But in my case, it does, I play with the similarity and bla bla
bla... Now my concern is that the Query.setBoost() does not always seems to
affect the score. I've built a simple test (code completely at the e
Hi Everyone,
I've been using Lucene a lot and I would like to know how the
SimilarityDelegator should be used. I would like to override only the
lengthNorm member of the DefaultSimilarity and I understand that this is
exactly the purpose of SimilarityDelegator ? Am I right? Does this class
What about:
http://svn.apache.org/viewcvs.cgi/lucene/java/trunk/src/java/org/apache/luce
ne/index/ParallelReader.java?rev=169859&view=markup
Jp
-Original Message-
From: Bruce Ritchie [mailto:[EMAIL PROTECTED]
Sent: Monday, May 30, 2005 11:26 AM
To: java-user@lucene.apache.org
Subject: RE:
oug Cutting [mailto:[EMAIL PROTECTED]
Sent: Wednesday, May 04, 2005 5:10 PM
To: java-user@lucene.apache.org
Subject: Re: PerFieldSimilarity
Robichaud, Jean-Philippe wrote:
> How cool, I did not knew that... that may help me... If I understand you
> correctly, I can create a boolean que
java-user@lucene.apache.org
Subject: Re: PerFieldSimilarity
Robichaud, Jean-Philippe wrote:
> Again, I can change
> the similarity of the reader at run-time and issue specific queries,
summing
> the score myself, but that is pretty inefficient.
You can also specify a Similarity implementation
From: Erik Hatcher [mailto:[EMAIL PROTECTED]
Sent: Tuesday, May 03, 2005 7:40 PM
To: java-user@lucene.apache.org
Subject: Re: PerFieldSimilarity
On May 3, 2005, at 5:57 PM, Robichaud, Jean-Philippe wrote:
> Hi Everyone,
>
> I've been searching the archive without success
ril 27, 2005 12:30 PM
To: java-user@lucene.apache.org
Subject: Re: Implementation of a ScoreObject ?
Robichaud, Jean-Philippe wrote:
>Probably the simplest/ideal schema of the ScoreObject would be something
>like a hashtable with Term being the keys and a TermScoreObject the value.
>The
Hi Everyone,
I've been searching the archive without success to answer this one: is it
possible to specify one similarity class per field, just like we can do with
an analyzer ? I know I can change the similarity of the searcher, but that
restrict me to break some complex queries into different
Hi Everyone,
Lucene is incredible for a lot of reasons. I've been using it
for the past months and it served me quite well. I'm using the subversion
snapshots, which I update every now and then. Almost every functionality I
need is already present and well implemented, but sadly
Hi Guys,
It is somewhat difficult to suggest something useful without more
details. If you a pretty sure of the quality of the query, then here is my
suggestion:
Index the documents with an extra field called "last_word" that will
contains the last word in the document. So from your exa
Hi everyone.
I've been playing with Lucene a lot in the past few months for an important
project. We are using the raw score returned by Lucene (we created a custom
similarity) as a part of a confidence score calculation. My problem is
exactly what the subject line of this email says: How to s
19 matches
Mail list logo
