Re: Indexing Query

2015-02-18 Thread Ian Lea
You mean you'd like a BooleanQuery.setMaximumNumberShouldMatch() method? Unfortunately that doesn't exist and I can't think of a simple way of doing it. -- Ian. On Wed, Feb 18, 2015 at 5:26 AM, Deepak Gopalakrishnan dgk...@gmail.com wrote: Thanks Ian. Also, if I have a unigram in the query,

Re: Indexing Query

2015-02-18 Thread Deepak Gopalakrishnan
Oops, alright, I'll probably look around for a workaround. On Wed, Feb 18, 2015 at 3:24 PM, Ian Lea ian@gmail.com wrote: You mean you'd like a BooleanQuery.setMaximumNumberShouldMatch() method? Unfortunately that doesn't exist and I can't think of a simple way of doing it. -- Ian.

Re: Indexing Query

2015-02-18 Thread Jack Krupansky
You could store the length of the field (in terms) in a second field and then add a MUST term to the BooleanQuery which is a RangeQuery with an upper bound that is the maximum length that can match. -- Jack Krupansky On Wed, Feb 18, 2015 at 4:54 AM, Ian Lea ian@gmail.com wrote: You mean

Re: Indexing Query

2015-02-17 Thread Deepak Gopalakrishnan
Thanks Ian. Also, if I have a unigram in the query, and I want to make sure I match only index entries that do not have more than 2 tokens, is there a way to do that too? Thanks On Wed, Feb 18, 2015 at 2:23 AM, Ian Lea ian@gmail.com wrote: Break the query into words then add them as

Indexing Query

2015-02-17 Thread Deepak Gopalakrishnan
Hello, I have a rather simple query. I have a list where I have terms like and then my query is more natural language. I want to be able to retrieve matches that has atleast 2 words in common between the query and the index Can you guys suggest a Query Type and a field that I should be using?

Re: Indexing Query

2015-02-17 Thread Ian Lea
Break the query into words then add them as TermQuery instances as optional clauses to a BooleanQuery with a call to setMinimumNumberShouldMatch(2) somewhere along the line. You may want to do some parsing or analysis on the query terms to avoid problems of case matching and the like. -- Ian.

FW: Binary indexing / query efficiency

2009-04-16 Thread Eger, Patrick
Resending, I think this got dropped by the list for some reason - Hi, was recently looking to incorporate Lucene for a simple parametric/faceted type search. The documents are very small, roughly 15 fields of short length (5-15 characters, generally strings and padded integers). When

Binary indexing / query efficiency

2009-04-14 Thread Eger, Patrick
Hi, was recently looking to incorporate Lucene for a simple parametric/faceted type search. The documents are very small, roughly 15 fields of short length (5-15 characters, generally strings and padded integers). When profiling query performance of our application, which inserts 1 million

Re: Binary indexing / query efficiency

2009-04-14 Thread Khawaja Shams
Hi, It is not a good idea to extract each document. You can be more efficient by only looking at the fields you are interested in. Depending on the size of your index, you can try: String[] codes = FieldCache.DEFAULT.getStrings(indexReader, fieldName); This returns a string [] with the length

Re: Binary indexing / query efficiency

2009-04-14 Thread eks dev
: Tuesday, 14 April, 2009 20:12:34 Subject: Binary indexing / query efficiency Hi, was recently looking to incorporate Lucene for a simple parametric/faceted type search. The documents are very small, roughly 15 fields of short length (5-15 characters, generally strings and padded integers). When