On Tue, Nov 2, 2010 at 7:17 AM, Martin Farach-Colton <martin(at)tokutek(dot)com> wrote:
> The B-tree bottleneck is inherent in the data structure, not a function of
> InnoDB vs postgresql vs ....
> Fractal trees do not perform disk seeks for each insertion, and they are
> therefore very good at insertions.
> Martin Farach-Colton
> Tokutek, Inc
It isn't that simple as I described earlier in this thread. InnoDB has
the insert buffer:
InnoDB can do a disk seek for each PK/unique index on a table during
an insert. It does not do disk seeks for each secondary index.
In response to
pgsql-advocacy by date
|Next:||From: Martin Farach-Colton||Date: 2010-11-08 16:23:18|
|Subject: Re: Probable faq: need some benchmarks of pgsql vr.s mysql|
|Previous:||From: Andrej||Date: 2010-11-07 22:50:47|
|Subject: Re: Using Religion to make a case for the