I am trying to implement category count almost similar to CNET approach. At the initialization time , I am trying to create all these BitSets and then trying to and them with user query(with a bitset obtained from queryfilter containing user query)..
This way my application is performant..Don't u think so? Actually I need all those bitsets everytime user queries. I can not use exisiting Lucene filter approach.. Is n't it?? Thx in advance, Jelda > -----Original Message----- > From: mark harwood [mailto:[EMAIL PROTECTED] > Sent: Tuesday, May 02, 2006 4:19 PM > To: java-user@lucene.apache.org > Subject: RE: OutOfMemoryError while enumerating through > reader.terms(fieldName) > > >>Any advise is relly welcome. > > Don't cache all that data. > You need a minimum of (numUniqueTerms*numDocs)/8 bytes to > hold that info. > Assuming 10,000 unique terms and 1 million docs you'd need > over 1 Gig of RAM. > > I suppose the question is what are you trying to achieve and > why can't you use the existing Lucene APIs instead of caching > all those bitsets? > > Cheers > Mark > > > > ___________________________________________________________ > Switch an email account to Yahoo! Mail, you could win FIFA > World Cup tickets. http://uk.mail.yahoo.com > > --------------------------------------------------------------------- > To unsubscribe, e-mail: [EMAIL PROTECTED] > For additional commands, e-mail: [EMAIL PROTECTED] > --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
