My Index DB is having 10 million records and it will grow to 30 million.
Currently I am using millisecond timestamp and the RAM cosumption is more. I
will change the resolution to minute. I am using 2 searcher objects
refreshing each other every minute. When i do a warmup query with sort of
timestamp then the cpu is spiked to 100% and this is happening for every
minute. In order to avoid these issues, i am planning to break my DB and to
do sort on indexed order.
Will multisearcher will maintain indexed order on sorting?
Regards
Ganesh
----- Original Message -----
From: "Erick Erickson" <[EMAIL PROTECTED]>
To: <java-user@lucene.apache.org>
Sent: Tuesday, October 21, 2008 8:18 PM
Subject: Re: Multisearcher will maintain index order sorting?
You say the timestamp sort is taking lots of RAM, which leads
me to ask "what resolution are you using and do you need
that great a resolution"?
As I understand it, sorting is sensitive to the number of unique
terms, so if you're storing millisecond timestamps you have a
whole lot more terms than if you store, say, minute resolution.
So one possibility would be to use a coarser resolution than
you are now, if you app can.
Best
Erick
On Tue, Oct 21, 2008 at 9:38 AM, Ganesh <[EMAIL PROTECTED]> wrote:
Hello all,
I need to maintain multiple db and i don't want to sort on datetime as it
is taking huge RAM. I want to sort on indexed order. Using Multisearcher
or
ParallelMultiSearcher will maintain the index order. If it does then i
don't
need to merge the indexDB.
Regards
Ganesh
Send instant messages to your online friends
http://in.messenger.yahoo.com
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
Send instant messages to your online friends http://in.messenger.yahoo.com
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
