On Thu, 2009-12-17 at 15:34 +0100, Ganesh wrote: > Thanks Toke. I worried to use long[] inverted = new long[reader.maxDoc]; > as the memory consumption will be high for millions of document.
Well, how many documents do you have? 10 million? That's just 160MB in overhead, of which the 80MB are temporary on the first search. > Any idea of building external sort cache? You could dump the order-array on disk (huge performance hit on conventional harddisks), but it's hard to avoid the temporary inverse-array upon first search. Of course, you could generate it on index build and thus have a memory-hit of virtual 0. --------------------------------------------------------------------- To unsubscribe, e-mail: java-user-unsubscr...@lucene.apache.org For additional commands, e-mail: java-user-h...@lucene.apache.org
