Re: hi compile error

Hi, replace /import org.apache.lucene.document.Field.*; / with /import org.apache.lucene.document.Field; / and you are done. Regards, kapilChhabra ashwin kumar wrote: hi all my name is ashwin i am trying to compile this program but its not getting compiled the error msg follows the code whi

Re: Most Frequent Terms

Hi Paul, I like the implementation of this in Luke (www.getopt.org/*luke*/) There is a HighFreqTerms class in src/org/getopt/luke/. Have a look. I am sure you'll find your answer there. Regards, kapilChhabra Paul Williams wrote: Hopefully this a straight forward question, but what's the reco

Re: how to make RangeQuery action as > < != operators?

In my case, I know the upper and lower limits of my field. So it becomes easy for me to run such queries. eg. *> * RangeQuery(value, upperLimit, inc) *<* RangeQuery(lowerLimit, value, inc) *!=* Use the in this case. eg: -field:value Regards, kapilChhabra David wrote: Hi all: I need to m

Re: My Category Search Problem

Hi Vijay, I have hit the same problem in the past and have evaluated various techniques to solve the same. 1. Using the QueryFilter The idea is to a) create BitSets for each category once initially b) run the search and extract the BitSet for the search results c) Logically "AND" the re

Re: Nested Queries

::= ( Clause )* Clause ::= ["+", "-"] [ ":"] ( | "(" Query ")" ) Which means that FIELD2:(FIELD2:3) is a correct query. Correct me if I am wrong. What will this query translate into? Will it be same as FIELD2: 1 OR FIELD2: 2 Thanks kapilChh

Re: Nested Queries

Hi All, Any pointers in this direction? Thanks in advance. Kapil Kapil Chhabra wrote: Just to mention, I have tokenized FIELD2 on "," and indexed it. FIELD2:3 should return 1,2 FIELD2:(FIELD2:3) should return something like the output of: *FIELD2: 1 OR FIELD2: 2 * Regards, ka

Re: Nested Queries

Just to mention, I have tokenized FIELD2 on "," and indexed it. FIELD2:3 should return 1,2 FIELD2:(FIELD2:3) should return something like the output of: *FIELD2: 1 OR FIELD2: 2 * Regards, kapilChhabra* * Kapil Chhabra wrote: Hi, Please see the following data

Nested Queries

Hi, Please see the following data-structure ++--+ | FIELD1 | FIELD2 | ++--+ | 1 | 2,3,4,6, | | 2 | 3,1,5,7, | | 3 | 1,2, | | 4 | 1,8,10, | | 5 | 2,9, | | 6 | 1, | | 7 | 2,9, | | 8 | 4,9, | | 9 |

Re: Search Suggestions

Exactly. I have implemented such a feature. Just to add on to what Bhavin said, your results would be more relevant if you index only 2 & 3 token phrases and display a 3 token suggestion if the current search keyword consists of 2 tokens and so on. Any suggestion beyond 3 tokens might not be ve

Re: range query on dates

In my applications, I have stored the dates as MMDD to make it simple and easy. Works just fine for me. regards, kapilChhabra Cam Bazz wrote: Hello, how can I make a query to bring documents between timestamp begin and timestamp end, given that I have stored my dates using DateTools.timeT

Re: FileNotFoundException: occurs during the optimization of index

You may try to update a copy of the index and then either replace the live index with the updated one or instruct other instances to update the index path. You may try this scenario if your index size is manageable. Hope this helps. Regards, kapilChhabra Supriya Kumar Shyamal wrote: I have comm

Re: Aggregating category hits

counts }), I will have no way to sort my results. Any pointers? Regards, kapilChhabra Kapil Chhabra wrote: Thanks a lot Jelda. I'll try this get back with the performance comparison chart. Regards, kapilChhabra Ramana Jelda wrote: Hi Kapil, As I remember FieldCache is in lucene api sinc

Re: Aggregating category hits

ginal Message- From: Kapil Chhabra [mailto:[EMAIL PROTECTED] Sent: Tuesday, May 16, 2006 11:50 AM To: java-user@lucene.apache.org Subject: Re: Aggregating category hits Hi Jelda, I have not yet migrated to Lucene 1.9 and I guess FieldCache has been introduced in this release. Can you please

Re: Aggregating category hits

Hi Jelda, I have not yet migrated to Lucene 1.9 and I guess FieldCache has been introduced in this release. Can you please give me a pointer to your strategy of FieldCache? Thanks & Regards, Kapil Chhabra Ramana Jelda wrote: But this BitSet strategy is more memory consuming mainly if

Re: Aggregating category hits

Even I am doing the same in my application. Once in a day, all the filters [for different categories] are initialized. Each time a query is fired, the Query BitSet is ANDed with the BitSet of each filter. The cardinality obtained is the desired output. @Eric: I would like to know more about the

Re: Most used words

his groups. What do you think? Kapil Chhabra wrote: Hi, If I have correctly understood your question, you want the terms in a field with the maximum number of occurences. Try luke [www.getopt.org/*luke*/]. Or else in case you are not able to initialize graphical content on your system. You may use

Re: Most used words

Hi, If I have correctly understood your question, you want the terms in a field with the maximum number of occurences. Try luke [www.getopt.org/*luke*/]. Or else in case you are not able to initialize graphical content on your system. You may use the following script. src/org/getopt/luke/HighF

Re: Corrupt index?

try to allocate more memory to your searcher. ex. java -mx1024m ... kapilChhabra On Tue, 2005-07-19 at 23:32, Kipping, Peter wrote: > Hi, > > I rebuilt my index with only a few minor changes, and now when I search > on it I get nothing but out of memory exceptions. I don't know what > would cau

search optimization - help

1. My application requires documents to be sorted on one of my indexed fields everytime. I use the hits.setSort() method to specify the field. In short my application will never use the scores generated by lucene search. Is calculating scores a overhead? Can I skip the process somehow? 2. let C