--- Alexey Polyakov <[EMAIL PROTECTED]> wrote:
> On 4/8/06, Kevin Burton <[EMAIL PROTECTED]> wrote:
>
> > Is there anyway I can tune MySQL to improve this operation?
>
> There's a fundamental problem with B-trees - inserts in a big B-tree
> can be very slow, cause it may require tree rebalanci
On 4/8/06, Kevin Burton <[EMAIL PROTECTED]> wrote:
> Is there anyway I can tune MySQL to improve this operation?
There's a fundamental problem with B-trees - inserts in a big B-tree
can be very slow, cause it may require tree rebalancing.
One workaround for this problem is partitioning. MySQL 5.1
I have a fairly small table WRT the data size. Its about 300M of
data. Right now it has about 6M rows.
The schema is pretty simple. It has one 64bit ID column. Basically
its for checking the existence of an object in our DB and is designed
to work very fast.
One the table was FIRST cr
