Re: Searching sets of documents

2008-10-13 Thread
I don't understand your problem? do you index file but want to search folder which contain the files? when you want to search folder, you can index folder, the data is all files under it. 2008/10/13 <[EMAIL PROTECTED]> > The docs are already indexed. > > > -Original Message- > > From: ??

Re: Searching sets of documents

2008-10-12 Thread
all folders which match "A AND Y", do you search for file name? If yes, A or Y in "A AND Y" is a Strring too, so you can do it by: construct a Lucene Document for each folder, and name of files under the folder is the search data. 2008/10/13 <[EMAIL PROTECTED]> > Hi, > > I want to search for sets

Re: Search warmup from Tomcat

2008-09-26 Thread
I my opinion. Set up two IndexSearcher, say #1 contain the old index data for query when #2 is updating. and turn query to #2 where updating is completed. 2008/9/26 Asbjørn A. Fellinghaug <[EMAIL PROTECTED]> > Ganesh: > > Hello all, > > > > I need to do warmup the searcher object from my JSP page

Re: lucene Front-end match

2008-09-21 Thread
;m aware of. >> >> A really good tool to see the transformations that happen to a query is >> Luke, open it up against your index, go into the search section, choose the >> analyzer you use and start playing around. >> >> This has helped me countless times when

Re: lucene Front-end match

2008-09-19 Thread
I am sorry, just put the string to QueryParser. But what make me confusing the code: Query query = qp.parse("bbb:\"b*\" AND ccc:\"cc*\""); doesn't work as i have expected. It drop the Wildcard *. 2008/9/19, 叶双明 <[EMAIL PROTECTED]>: > > Thanks

Re: lucene Front-end match

2008-09-19 Thread
Thanks! Now, I just use Query query = qp.parse("a*"); and meet the my requirements. Another question: how to parser query string like: title:"The Right Way" AND text:go please show me in java code. thanks. 2008/9/19 Karl Wettin <[EMAIL PROTECTED]> > >

lucene Front-end match

2008-09-19 Thread
Hi, all! How to implement Front-end match use lucene? Say, two Documents in index: Document> Document> How can I get the first Document buy some query string like "a" , "ab" or "abc" but no "b" and "bc"? Any input is appreciate! -- Sorry for my English!! 明 Please help me correct my English exp

Re: Lucene search fails for japanese characters in URL

2008-09-18 Thread
it should work. Please let me know if any > issues. > > > 叶双明 wrote: > > > > And, you can use Tool luke to see what is in the index indeed. > > what is in the Query which put into IndexSearcher.search(), what is the > > defaultOperatoer of QueryParser. >

Re: Lucene search fails for japanese characters in URL

2008-09-18 Thread
t; Hi, > > I do get the same string from Mysql and also in servlet request. I could > observe the actaul string in eclipse while debugging. it is stored as UTF-8 > format so retrievel is coming as stored. > > plz let me know if iam not clear > > > 叶双明 wrote: > >

Re: Lucene search fails for japanese characters in URL

2008-09-17 Thread
You must trace the string in each step! Important step is get string from MYSQL and get parameter in servlet, please check it, do you get the right string? Chinese has the same problem too. 2008/9/17 anandsarwade <[EMAIL PROTECTED]> > > Hello Jimi, > > Thanks a lot for your valuable suggestion.

Re: Web Application Indexing Error

2008-09-09 Thread
use classpath! 2008/9/9 Alexander Aristov <[EMAIL PROTECTED]> > Hi > > Build path and classpath at runtime are different matters. Where do you run > your servlet, in which container. > > Mainly all servlet containers should add all libraries located under > WEB-INF/lib, so you must place your luc

Re: Problem with lucene search starting to return 0 hits when a few seconds earlier it was returning hundreds

2008-09-06 Thread
Have you ignore any Exception during query? make sure of it. 2008/9/5, Erick Erickson <[EMAIL PROTECTED]>: > > I've been tracking this list for a year or more, and this is the > first I've ever heard of such a thing. Which leads me to wonder > what *else* changed besides your index size. Classpa

Re: Searching in multiple indices

2008-09-06 Thread
In my opinion, you can use MultiSearcher, or if there isn't huge data in index, you can put them in one index, no matter the fields in indices are not the same. You can get Docoument match your query, but I think, you will think about the query that you want to put into the IndexSearcher. 2008/9/6

Re: Lucene Memory Leak

2008-09-05 Thread
In my opinion, do no need to close the Directory, and keep all Directory and all IndexSearcher open. return ivIndexSearcher.search(query, sortOrder); ( I think) is also return the hits getted frmo IndexSearcher, so it is iterate over the first N, no problem. In addition, how much index Directory

Re: lucene ram buffering

2008-09-05 Thread
IndexWriter.setRAMBufferSizeMB() Determines the amount of RAM that may be used for buffering added documents before they are flushed as a new Segment. Does it related to IndexSearcher? And IndexSearcher hasn't setRAMBufferSizeMB() method, mean we can't control the amount of RAM that may be used fo

Re: How can we know if 2 lucene indexes are same?

2008-09-05 Thread
t the IndexSearcher affected by the indexing process? After the indexing, reopen the IndexSearcher to load the new data. 2008/9/5, 叶双明 <[EMAIL PROTECTED]>: > > There is more and more complex, actually I hava a small index system can > config multiple index server for quer

Re: How can we know if 2 lucene indexes are same?

2008-09-05 Thread
There is more and more complex, actually I hava a small index system can config multiple index server for query, In my opinion, because index update operating is synchronized between different Thread that update the index, so for indexing new data : can process data that want to index at the ma

Re: How can we know if 2 lucene indexes are same?

2008-09-05 Thread
t; documents from changing the index until the optimize() call completed. > > > > So, your test is expected to fail: you're not allowed to open 2 "writers" > on > > a single index at the same time, where "writer" includes an IndexReader > that > >

Re: QueryParser vs. BooleanQuery

2008-09-04 Thread
Indeed, StandardAnalyzer removing the pluses, so analyse 'c++' to 'c'. QueryParser include Term that been analysed. And BooleanQuery include Term that hasn't been analysed. I think this is the difference between they. 2008/9/4 Ian Lea <[EMAIL PROTECTED]> > Have a look at the index with Luke to

Re: How can we know if 2 lucene indexes are same?

2008-09-04 Thread
> So, your test is expected to fail: you're not allowed to open 2 "writers" > on a single index at the same time, where "writer" includes an IndexReader > that deletes documents; so those exceptions (LockObtainFailed, StaleReader) > are expected. > > Mike > &

Re: How can we know if 2 lucene indexes are same?

2008-09-04 Thread
PROTECTED]>: > > > Actually, as of 2.3, this is no longer true: merges and optimizing run in > the background, and allow add/update/delete documents to run at the same > time. > > I think it's probably best to use application logic (outside of Lucene) to > keep trac

Re: delete/reset the index

2008-09-04 Thread
Agree with Michael McCandless!! By that way,it is handling gracefully. 2008/9/4 Michael McCandless <[EMAIL PROTECTED]> > > If you're on Windows, the safest way to do this in general, if there is any > possibility that readers are still using the index, is to create a new > IndexWriter with creat

Re: How can we know if 2 lucene indexes are same?

2008-09-04 Thread
No documents can added into index when the index is optimizing, or optimizing can't run durling documents adding to the index. So, without other error, I think we can beleive the two index are indeed the same. :) 2008/9/4 Noble Paul നോബിള്‍ नोब्ळ् <[EMAIL PROTECTED]> > The use case is as follow

Re: delete/reset the index

2008-09-04 Thread
Delete the index Directory in File System, I think this is the simpliest!!! 2008/9/4 simon litwan <[EMAIL PROTECTED]> > hi all > > i would like to delete the the index to allow to start reindexing from > scratch. > is there a way to delete all entries in a index? > > any hint is very appreciated.