Re: search exception in servlet!Please help me

2004-08-04 Thread Srikanth Balusni
By observing the implementation details of the Hits object lucene, I feel that Hits.doc(n) intends 'n' to be the index of the results. So, my feeling is that progam which Li wrote should work ideally. Erik, Correct me if I am wrong. Li, Can you post entire stack trace? Thanks, sri hi,Erik

Re: search exception in servlet!Please help me

2004-08-04 Thread Christiaan Fluit
Erik Hatcher wrote: Where did you get 'i'? Keep in mind that using Hits.doc(n) intends 'n' to be a document *id*, not the iteration through the Hits collection. This is a very common mistake, and I'm guessing one you've made here. I believe the Javadoc (as well as my own experience) tells

Negative Boost

2004-08-04 Thread Terry Steichen
I can't get negative boosts to work with QueryParser. Is it possible to do so? TIA, Terry

Re: Negative Boost

2004-08-04 Thread Morus Walter
Terry Steichen writes: I can't get negative boosts to work with QueryParser. Is it possible to do so? If you change QueryParser ;-) Morus - To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL

Re: Negative Boost

2004-08-04 Thread Erik Hatcher
On Aug 4, 2004, at 7:19 AM, Terry Steichen wrote: I can't get negative boosts to work with QueryParser. Is it possible to do so? Closer inspection on the parsing: Boost TOKEN : { NUMBER:(_NUM_CHAR)+ ( . (_NUM_CHAR)+ )? : DEFAULT } where #_NUM_CHAR: [0-9] So, no, negative boosts don't

Re: Negative Boost

2004-08-04 Thread Otis Gospodnetic
You can just use boost that is 1.0, no? Otis --- Terry Steichen [EMAIL PROTECTED] wrote: I can't get negative boosts to work with QueryParser. Is it possible to do so? TIA, Terry - To unsubscribe, e-mail:

Re: Hit Score [ Between ]

2004-08-04 Thread Doug Cutting
You could instead use a HitCollector to gather only documents with scores in that range. Doug Karthik N S wrote: Hi Apologies If I want to get all the hits for Scores between 0.5f to 0.8f, I usally use query = QueryParser.parse(srchkey,Fields, analyzer); int tothits =

Question on number of fields in a document.

2004-08-04 Thread John Z
Hi I had a question related to number of fields in a document. Is there any limit to the number of fields you can have in an index. We have around 25-30 fields per document at present, about 6 are keywords, Around 6 stored, but not indexed and rest of them are text, which is analyzed and

Re: Negative Boost

2004-08-04 Thread Daniel Naber
On Wednesday 04 August 2004 13:19, Terry Steichen wrote: I can't get negative boosts to work with QueryParser. Is it possible to do so? Isn't that the same as using a boost 1, e.g. 0.1? That should be possible. Regards Daniel

Re: Negative Boost

2004-08-04 Thread Terry Steichen
Near as I can tell, setting the boost to, say, 0.10, doesn't seem to do anything. Regards, Terry - Original Message - From: Otis Gospodnetic To: Lucene Users List Sent: Wednesday, August 04, 2004 9:38 AM Subject: Re: Negative Boost You can just use boost that is 1.0,

Re: Negative Boost

2004-08-04 Thread Terry Steichen
Well, I'm not too confident of my JavaCC skills, and when I've messed around with this stuff in the past, I sometimes ended up inadvertently creating problems in other areas of the query syntax. But if, in the future, I or someone else took on this task of enhancing QueryParser, I'd like to

RE: Question on number of fields in a document.

2004-08-04 Thread Aviran
You should be fine, no problem with the number of fields -Original Message- From: John Z [mailto:[EMAIL PROTECTED] Sent: Wednesday, August 04, 2004 12:23 PM To: [EMAIL PROTECTED] Subject: Question on number of fields in a document. Hi I had a question related to number of fields in a

Re: Question on number of fields in a document.

2004-08-04 Thread Paul Elschot
On Wednesday 04 August 2004 18:22, John Z wrote: Hi I had a question related to number of fields in a document. Is there any limit to the number of fields you can have in an index. We have around 25-30 fields per document at present, about 6 are keywords, Around 6 stored, but not indexed

Re: Negative Boost

2004-08-04 Thread markharw00d
A solution to this has been proposed before - see http://wiki.apache.org/jakarta-lucene/CommunityContributions Cheers Mark - To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]

Question on the minimum value for DateField

2004-08-04 Thread Terence Lai
Hi All, I realize that the DateField cannot except the value which is before the Year 1970, specifically in the org.apache.lucene.document.DateField.timeToString() method. Is there are any techincal reason for this limitation? Thanks, Terence

Re: Question on number of fields in a document.

2004-08-04 Thread John Z
Thanks I was looking at some older email on the list and found an email where Doug Cutting says that fields not analyzed, we need not store the norms , nor load them into memory. That change in the indexer will help a lot in this situation, where we might have 24 fields indexed but not

RE: Question on the minimum value for DateField

2004-08-04 Thread wallen
The date is stored as a Long that is the number of seconds since jan 1970. Anything before that would be negative. -Original Message- From: Terence Lai [mailto:[EMAIL PROTECTED] Sent: Wednesday, August 04, 2004 6:25 PM To: Lucene Users List Subject: Question on the minimum value for

Split an existing index into smaller segments without a re-index?

2004-08-04 Thread Kevin A. Burton
Is it possible to take an existing index (say 1G) and break it up into a number of smaller indexes (say 10 100M indexes)... I don't think theres currently an API for this but its certainly possible (I think). Kevin -- Please reply using PGP. http://peerfear.org/pubkey.asc

Re: Split an existing index into smaller segments without a re-index?

2004-08-04 Thread Doug Cutting
Kevin A. Burton wrote: Is it possible to take an existing index (say 1G) and break it up into a number of smaller indexes (say 10 100M indexes)... I don't think theres currently an API for this but its certainly possible (I think). Yes, it is theoretically possible but not yet implemented. An