Re: BooleanQuery Performance Help

2008-12-22 Thread Erick Erickson
Well, you haven't run afoul of the usual suspects, that's pretty clean timing code. I'm afraid I'll have to defer to the people who know the internals of Lucene. Best Erick On Sun, Dec 21, 2008 at 10:31 PM, Prafulla Kiran wrote: > Hi, > > Here's the code which I am using to time the query: >

Re: BooleanQuery Performance Help

2008-12-21 Thread Prafulla Kiran
Hi, Here's the code which I am using to time the query: long startTime = System.currentTimeMillis(); TopDocCollector collector = new TopDocCollector(10); is.search(query,collector); ScoreDoc[] hits = collector.topDocs().scoreDocs; long endTime = System.currentTimeMillis(); Most of the clauses w

Re: BooleanQuery Performance Help

2008-12-20 Thread Erick Erickson
What specifically are you measuring when you time the queries? I've been mislead by including in my measurement say, creating the response. I realize that throughput includes assembling the response, but the solution is different depending upon whether it's the actual search or what you do with the

Re: BooleanQuery Performance Help

2008-12-20 Thread Paul Elschot
Op Saturday 20 December 2008 15:23:43 schreef Prafulla Kiran: > Hi Everyone, > > I have an index of relatively small size (400mb) , containing roughly > 0.7 million documents. The index is actually a copy of an existing > database table. Hence, most of my queries are of the form > > " +field1:value