Can multiple JVMs search an index with one JVM writing to it?

2007-11-06 Thread Matt Magoffin
Hello, I tried finding information about this from past mailing list emails, but couldn't find anything. I'm using Lucene 1.4 series and wondered if it is safe for two different JVMs opening and searching the same physical index located on the local file system, with one of the JVMs performing writ

Re: How to build your custom termfreq vector an add it to the field ?

2007-11-06 Thread Grant Ingersoll
My guess is you want to look into the Scorer implementations. I am not sure Lucene's term vector storage is needed, you could just store the terms as they always are and implement your own Query/Weigh/Scorer combo that ignores TF and uses your new approach. See http://lucene.apache.org/jav

Re: Search performance using BooleanQueries in BooleanQueries

2007-11-06 Thread Mike Klaas
On 6-Nov-07, at 3:02 PM, Paul Elschot wrote: On Tuesday 06 November 2007 23:14:01 Mike Klaas wrote: Wait--shouldn't the outer-most BooleanQuery provide most of this speedup already (since it should be skipTo'ing between the nested BooleanQueries and the outermost). Is it the indirection and

Re: Search performance using BooleanQueries in BooleanQueries

2007-11-06 Thread Paul Elschot
On Tuesday 06 November 2007 23:14:01 Mike Klaas wrote: > On 29-Oct-07, at 9:43 AM, Paul Elschot wrote: > > On Friday 26 October 2007 09:36:58 Ard Schrijvers wrote: > >> +prop1:a +prop2:b +prop3:c +prop4:d +prop5:e > >> > >> is much faster than > >> > >> (+(+(+(+prop1:a +prop2:b) +prop3:c) +prop4:d)

Re: Search performance using BooleanQueries in BooleanQueries

2007-11-06 Thread Mike Klaas
On 29-Oct-07, at 9:43 AM, Paul Elschot wrote: On Friday 26 October 2007 09:36:58 Ard Schrijvers wrote: +prop1:a +prop2:b +prop3:c +prop4:d +prop5:e is much faster than (+(+(+(+prop1:a +prop2:b) +prop3:c) +prop4:d) +prop5:e) where the second one is a result from BooleanQuery in BooleanQuery

Re: How to generate TermFreqVector from an existing index

2007-11-06 Thread Grant Ingersoll
You would have to take the original input and re-analyze it and put it into the TermFreqVector format. It's just a list of terms and their frequencies for a given doc, so it should be pretty straightforward to do. Just extra runtime computation. -Grant On Nov 6, 2007, at 1:06 AM, Shailen

Re: Get the terms and frequency vector of an indexed but unstored field

2007-11-06 Thread Karl Wettin
6 nov 2007 kl. 09.51 skrev Shailendra Mudgal: Hi, If while indexing we have not set this flag, then is there any other way to get this info, i mean the TermFreqVector for a document ?? See TermVectorAccessor in JIRA. http://issues.apache.org/jira/browse/LUCENE-1016 The highligher also has

Re: Get the terms and frequency vector of an indexed but unstored field

2007-11-06 Thread Shailendra Mudgal
Hi, If while indexing we have not set this flag, then is there any other way to get this info, i mean the TermFreqVector for a document ?? On 8/3/07, testn <[EMAIL PROTECTED]> wrote: > > > you can use IndexReader.getTermFreqVectors(int n) to get all terms and > their > frequencies. Make sure whe

Re: Group by in Lucene ?

2007-11-06 Thread Marcus Herou
Cool. I'll do since this is a field which I can spend time in. Kindly //Marcus On 11/5/07, Grant Ingersoll <[EMAIL PROTECTED]> wrote: > > > On Nov 5, 2007, at 7:49 AM, Marcus Herou wrote: > > > Thanks. They seem to have got real far in the dev cycle on this. > > Seems like > > it will hit the ro