Any storage initatives for optimized indexing/searching

It seems that the performance aspects of any indexing/searching algorithm is very much dependent upon the disk-access-technologies. Just curious, anybody know of any company working(mostly storage companies) in improving their storage/disk access technology to make indexing/searching effici

Re: using boolean operators with the PhraseQuery

I tried using the boolean query to perform an OR as below BooleanQuery b1 = new BooleanQuery(); b1.add(query,BooleanClause .Occur .SHOULD ); b1.add(query2,BooleanClause .Occur .SHOULD ); Hits hits = searcher.search(b1); System.out.println("Query= "+b1.toString() ); gave me Qu

Re: using custom sort method

: I have asked the exact same question a few weeks ago. I just follow the : customized distance example and loop the results again to get another : field and compute the scores. It will be painful if you need more than 3 : fields. So far I didn't find any other way to do it. Hope we can see It's

Remote Parallel MultiSearcher

Hi All, What I have understood from Lucene Remote Parallel Multi Searcher Search Procedure is first compute the weight for the Query in each Index sequentially (one by one, eg: - calculate "query weight" of index1 first and then index2) and then perform searching of each index one by one and merge

Re: using boolean operators with the PhraseQuery

: The code above just adds the terms of phrase2 following the : terms for phrase1. : Can you give me an example building a BooleanQuery OR for the : newTerm1 and newTerm2. At no point does your code use a BooleanQuery ... have you looked at the javadocs for the BooleanQuery class? -Hoss --

Re: using custom sort method

I have asked the exact same question a few weeks ago. I just follow the customized distance example and loop the results again to get another field and compute the scores. It will be painful if you need more than 3 fields. So far I didn't find any other way to do it. Hope we can see some new cl

Re: using boolean operators with the PhraseQuery

I am not sure if I understand you. Do I add the terms for the second phrase immediately after I add the terms for the first phrase. When do i wrap the PhraseQuery I construct into a BooleanQuery. For instance String newTerm1= "avoids deadlock"; String newTerm2= "reduces cost"; PhraseQuery query =

Re: using boolean operators with the PhraseQuery

Wrap the PhraseQuery's inside a BooleanQuery to achieve AND/OR. Erik On Apr 18, 2006, at 10:00 PM, Vishal Bathija wrote: Hi, I am trying to find the number of hits for a phrase using the PhraseQuery. I would like to know how I could seach for 2 phrases at the same time using the boole

using boolean operators with the PhraseQuery

Hi, I am trying to find the number of hits for a phrase using the PhraseQuery. I would like to know how I could seach for 2 phrases at the same time using the boolean operators OR, AND. The code snippet that I use to seach for one phrase is String test ="avoids deadlock" String[] phraseTerms = tes

Re: using custom sort method

No...the information is available only at search time Quoting Erik Hatcher <[EMAIL PROTECTED]>: Could your computation be done at indexing time rather than at search time? If so, pre-compute the value and index that into a single field. Erik On Apr 18, 2006, at 3:46 PM, Urvashi G

Re: using custom sort method

Could your computation be done at indexing time rather than at search time? If so, pre-compute the value and index that into a single field. Erik On Apr 18, 2006, at 3:46 PM, Urvashi Gadi wrote: Hello All, My requirement is to combine 2 or more fields using some critera (for exa

Re: wildcards with SpanQuery

There isn't a SpanWildcardQuery, per se, but there is a SpanRegexQuery: It can be used to achieve the same sort of thing, only using standard regex syntax like fast.* (instead of fast

using custom sort method

Hello All, My requirement is to combine 2 or more fields using some critera (for example weighted average) and sort the search results based on the combined fields. I am looking at DistanceComparatorSource class to implement custom sort but it takes only one field for calculation and then so

Re: wildcards with SpanQuery

18 apr 2006 kl. 20.10 skrev Michael Dodson: Is it possible to use wildcards with SpanNearQuery? For example, if the user enters "fast car" with a slop of 1 things like "fast cars" "faster cars" "fast brown cars" etc would be found? You might be looking for stem-analysis? You can, for insta

wildcards with SpanQuery

Is it possible to use wildcards with SpanNearQuery? For example, if the user enters "fast car" with a slop of 1 things like "fast cars" "faster cars" "fast brown cars" etc would be found? Thanks, Mike - To unsubscribe, e-m

Re: Indexing - scheduled batch process or server?

Marc, I am using it within the web app. I use Spring and there are ways to throttle a call down to one thread with Spring, if you're worried about overloading the server when you update the index. I'm not sure about Quartz and its ability to set a priority or limit the number of threads

Re: hypens

On 4/18/06, John Powers <[EMAIL PROTECTED]> wrote: > What do you mean by "use index and search analyzers". Don't you always > have to pass in an analyzer? I am using the standardanalyzer in both > cases. I think he means a different analyzer for search than is used for indexing. It can make se

RE: hypens

I mean, using separate analyzers for indexing & searching.. I will not use any standard analyzers provided by lucene rather implement a custom anaylzer which is not so difficult. Jelda > -Original Message- > From: John Powers [mailto:[EMAIL PROTECTED] > Sent: Tuesday, April 18, 2006 4:

RE: hypens

What do you mean by "use index and search analyzers". Don't you always have to pass in an analyzer? I am using the standardanalyzer in both cases. Which analyzer are you recommending I use for this? -Original Message- From: Ramana Jelda [mailto:[EMAIL PROTECTED] Sent: Tuesday, Apri

Re: Indexing - scheduled batch process or server?

On 4/17/06, Marc Dauncey <[EMAIL PROTECTED]> wrote: > or has anyone > implemented a more sophisticated solution with web > services to index on demand? In Solr, documents (XML versions of Lucene Documents) are POSTed to the server. There are explicit commands that cause an new IndexReader to be o

Re: Indexing - scheduled batch process or server?

Thanks for the response, Jeremy. Quartz seems like a great solution - are you running it within the app server? I think the benefits of doing this would be convenience of messaging the search server to pick up fresh indexes. Previously I considered a CRON job and was thinking of making a web serv

Re: Max Frequency and Tf/Idf

18 apr 2006 kl. 11.45 skrev Danilo Cicognani: Following is the code we are using now: we was considering the possiblity to have more informations from Lucene (for example the maximum term frequency in one document) to optimized the calculations. The first method is the one that start the ca

Re: Max Frequency and Tf/Idf

Hi Grant Ingersoll and everybody. > The Term Vector code can be used to get the term frequencies from a > specific document. Search this list, see the Lucene In > Action book or > look at http://www.cnlp.org/apachecon2005 for examples on how to use > Term Vectors Maybe I didn't explain well my

RE: hypens

Hi, I would use index & search analyzers in this case.. "b-trunk" is analyzed & indexed as b,btrunk,trunk Search term "b-trunk" is anlayzed using search analyzer as "btrunk" and searched. U will find the result.. Similarly for 12412-235, 12412-121, 12412-etc , indexed as 12412,12412235,235 etc...