[Date Prev][Date Next] [Chronological] [Thread] [Top]

Re: (ITS#3851) Berkeley DB Scalability Patch

--On Thursday, July 28, 2005 2:56 PM -0400 Jong-Hyuk 
<jongchoi@watson.ibm.com> wrote:

>> That is the question I'm interested in having an answer to.  Its great
>> if the patch holds up if you do 500 billion entry databases.  If it
>> can't function when you have more than some X number of indices, where
>> X is rather small, then its usefulness becomes suspect.
> I don't agree with your last point. As I said earlier, with the data you
> gathered, you cannot tell whether the performance difference comes from
> indexing or not. Also, scalability means a lot more than just having high
> performance for every scaling point in the range. I would think it
> acceptable to spend 12 minutes instead of 9 in adding 100K entries if it
> is able to reduce the time for 4 million entries from 11 hours to just
> one.

This isn't what I was saying.  If it takes 15 minutes instead of 10 for 
100K entries, and increases the time from 11 hours to 20 hours for 4 
million entries if you use a lot of indices, then its usefulness becomes 
suspect.  Which is why I'm curious if you have any data points using a 
large number of indices that indicates anything one way or the other.  I 
can only assume from your responses that the answer is "no".


Quanah Gibson-Mount
Product Engineer
Symas Corporation
Packaged, certified, and supported LDAP solutions powered by OpenLDAP: