Monthly Archives - June 2010

Making Deletions Fast, by Avoiding Disk Seeks

In my last post, I discussed how fractal tree data structures can be up to two orders of magnitude faster on deletions over B-trees. I focused on the deletions where the row entry is known (the storage engine API handler::delete_row), but I did not fully analyze how MySQL delete statements can be fast. In […]

Read more

Disk seeks are evil, so let’s avoid them, pt. 3 (Deletions)

As mentioned in parts 1 and 2, having many disk seeks are bad (they slow down performance). Fractal tree data structures minimize disk seeks on ad-hoc insertions, whereas B-trees practically guarantee that disk seeks are performed on ad-hoc insertions. As a result, fractal tree data structures can insert data up to two orders of […]

Read more

Security fixes for MySQL 4.0 and 4.1

In Percona Server security fix releases I mentioned patches for MySQL 4.0 and 4.1.
I am happy to announce that released patches for MySQL 4.0 and MySQL 4.1 under GPL license and you can get them from our Launchpad:
for 4.0: lp:~percona-dev/percona-patches/4.0.30 ( or )
for 4.1: lp:~percona-dev/percona-patches/4.1.24 ( or
Fixed bugs:

Bug#53371, CVE-2010-1848
Bug#53237, CVE-2010-1850
Bug#50974, CVE-2010-1849

If […]

Read more