http://lucene.apache.org/java/2_2_0/api/org/apache/lucene/index/IndexDeletionPolicy.html
This only works for Lucene 2.2 and later, not available if you need to used
Lucene 2.0.
--
Chris Lu
-
Instant Scalable Full-Text Search On Any Database/Application
site: http://www.db
I would like to attend the one by Hossman Thursday evening.
Thanks
-John
On 10/16/07, Grant Ingersoll <[EMAIL PROTECTED]> wrote:
>
> If you are planning on attending ApacheCon in Atlanta, let us know if
> you are interested in attending the Birds of a Feather meeting by
> expressing that interest
Thanks a lot for the response!
Is there some special config that needs to be done to share the locks
or just point both servers to the same location ?
Pointers to docs would help a great deal too...
Thanks again!
On Oct 17, 2007, at 5:54 PM, Chris Lu wrote:
To my experience from a project,
Hi Philipp,
At 10:49 pm +0100 3/7/07, Paul Elschot wrote:
On Wednesday 07 March 2007 18:12, Philipp Nanz wrote:
Thanks for your answers. Your input is really appreciated :-)
@Paul Elschot:
Thanks for the hint. I guess I could use coord() to penalize missing
terms like this:
Query: a b c
To my experience from a project, using software DBSight, Lucene runs well on
a SAN environment.
No experience of a NFS, but I know many indexing errors caused by NFS. Maybe
the new index delete policy helps in latest version of Lucene.
--
Chris Lu
-
Instant Scalable Full-T
Hi All!
We use lucene 2.0.0 as the search index of our portal (liferay based)
and are trying to use it correctly in a cluster...
I'm very foggy on wether i should share the index file using NFS (the
servers run linux) or wether we should try the jdbc store...
We currently have the index i
From: Paul Elschot
> One can use SpanNotQuery to get NOT NEAR by using this generalized
> structure:
>
> SpanNot(foo, SpanNear(foo, bar, distance))
>
> This also allows for example:
>
> SpanNot(two, SpanNear(one, three, distance))
>
> Btw. I don't know of any query language that has this second
Dave,
One can use SpanNotQuery to get NOT NEAR by using this generalized structure:
SpanNot(foo, SpanNear(foo, bar, distance))
This also allows for example:
SpanNot(two, SpanNear(one, three, distance))
Btw. I don't know of any query language that has this second form.
AND NOT normally does no
Sounds like you just want a BUTNOT of a NearSpan.
There is no Span support in the Lucene query language, but if there where:
*:* BUTNOT NearSpan(foo, bar, 10)
(or does lucene call it ANDNOT...)
Dave Golombek wrote:
We've run into a situation where having "NOT NEAR" queries would really
help.
We've run into a situation where having "NOT NEAR" queries would really
help. I haven't been able to find any discussion of adding this to Lucene in
the past, so wanted to ask if people had any comments about it before I
started trying to make the change.
I've looked at NearSpansUnordered and it
I think the answer is:
[{ "MAddDocs" AddDoc } : 5000] : 4
Is this the functional equivalent of doing:
{ "MAddDocs" AddDoc } : 2
in parallel?
Thanks,
Grant
On Oct 17, 2007, at 10:42 AM, Grant Ingersoll wrote:
Hi,
I am using the contrib/benchmarker to do some performance tests. I
have
Hi,
I am using the contrib/benchmarker to do some performance tests. I
have a 4 core machine, so I would like to test using 4 threads for
indexing. From the docs at http://lucene.zones.apache.org:8080/
hudson/job/Lucene-Nightly/javadoc/org/apache/lucene/benchmark/byTask/
package-summary.h
On 10/17/07, Melanie Langlois <[EMAIL PROTECTED]> wrote:
> From a different post I've read on this mailing list, I thought by letting
> this default the optimization will be done automatically every 10 documents
> added to the index (and then every 10 segments, they should be merges..). But
> fo
Ok,
I found some of my answers looking more into the code, I can actually print the
merging infos settings up the IndexWriter.setInfoStream ..
But there is still some stuff I don't get regarding the index optimization
process, I'm don't understand where the merging of document is done by default
14 matches
Mail list logo
