Re: IndexReader open problem?

gest an approach. > > Best > Erick > > On Dec 27, 2007 8:59 AM, Zhou Qi <[EMAIL PROTECTED]> wrote: > > > Hi all, > > > > I encounter a strange probelm. To improve performance, I open the > > indexreader at the start time and reuse it in later search.

IndexReader open problem?

Hi all, I encounter a strange probelm. To improve performance, I open the indexreader at the start time and reuse it in later search. I have another process running to do online indexing. The search service and indexing service is accessing the same index folder. But I found out the search servi

Re: Index lucene database details.

Hi Grant, The exception is throw from java native method."Failed to merge indexes, java.lang.OutOfMemoryError: Java heap space ". ( I have set the -Xmx1024m in JVM.) I guess it is similar as the problem appeared in previous thread before ( http://www.nabble.com/Index-merge-and-java-heap-space-tt50

Re: Pagination ...

Using the search function for pagination will carry out unnecessary index search when you are going previous or next. Generally, most of the information need (e.g 80%) can be satisfied by the first 100 documents (20%). In lucene, the returing documents is set to 100 for the sake of speed. I am not

Re: Re: Re: optimize Index problem

Hi , Grant After I adjust the mergefactor of indexwriter from 1000 to 100, it worked. Thank you. 22 Dec 2007 07:05:05 -0600, [EMAIL PROTECTED] <[EMAIL PROTECTED]>: > > AUTOMATIC REPLY > > LUX is closed until 7th January 2008 > > most information about LUX is available at www.lux.org.uk > > > >

optimize Index problem

Hi guys, I met some trouble in optimizing the index. The index looks fine in Luke and I can carry out the search in the index. However, when I try to merge all these seperated files into a complete index. A java internal exception indicates that the file are too large.The index size is about 40G

Re: Which file in the lucene package is used to manipulate results..

Hi Sumittyagi, I think you can implement your factors in the scorer to obtain your desired results. 2007/12/21, mark harwood <[EMAIL PROTECTED]>: > > I think you need to describe your "factors" in more detail. Exactly what > do you want to achieve for your users? > We could be talking about

Re: Giving boost to a more recent item whiule searching

Brain, Can you simply describe the method you tried? I am very intertested in that. Jackson 2007/12/20, Brian Grimal <[EMAIL PROTECTED]>: > > I would love to revisit this one. I implemented pseudo date boosting in > an overly simplistic manner in my app, which I know can be improved > upon.

答复: 答复: how to effeciently imple ment the stastical scores like p agerank?

It works. John and Michael Thank you very much. Best Regards, Zhou Qi Dept. Computer Science & Engineering Shanghai Jiaotong University -邮件原件- 发件人: Michael Busch [mailto:[EMAIL PROTECTED] 发送时间: 2007年11月16日 2:34 收件人: java-user@lucene.apache.org 主题: Re: 答复: how to effecie

答复: how to effeciently implement the stastical scores like pager ank?

score (stored in the index) to sum the overall score. It is inefficient. How to improve that by a new approach? Sorry for making you misunderstanding. Thanks Best Regards, Zhou Qi Dept. Computer Science & Engineering Shanghai Jiaotong University -邮件原件- 发件人: Chee Wu [mailto:[E

how to effeciently implement the stastical scores like pagerank?

. Best Regards, Zhou Qi Dept. Computer Science & Engineering Shanghai Jiaotong University