Emergency

Search Results for: innodb insertions are slow

Hot Column Addition and Deletion Part I – Performance

From 18 hours to 3 seconds! Hot Column Addition and Deletion (HCAD) Overview TokuDB v5.0 introduces several features that are new to the MySQL world. In this series of posts, we’re going to present some …

Read More
 

TokuDB FAQ

by:

Links to the FAQ Sections can be found here: General Information Open Source Technical Details Best Practices and Tools General Information ANY CHARACTER HERE 1.    What is TokuDB? TokuDB is an ACID compliant storage engine for …

Read More
 

Avoiding Fragmentation with Fractal Trees

Summary B-trees suffer from fragmentation. Fragmentation causes headaches — in query performance and space used. Solutions, like dump and reload or OPTIMIZE TABLE are a pain and not always effective. Fractal trees don’t fragment. So …

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 …

Read More
 

Disk Seeks are Evil, so Let’s Avoid Them, Part 1

Disk seeks are expensive. Typically, a disk can perform no more than a few hundred seeks per second. So, any database operation that induces a disk seek is going to be slow, perhaps unacceptably slow. …

Read More
 

The Depth of a B-tree

Schlomi Noach recently wrote a useful primer on the depth of B-trees and how that plays out for point queries — in both clustered indexes, like InnoDB, and in unclustered indexes, like MyISAM. Here, I’d …

Read More
 

iiBench with deletes

We modified the iiBench benchmark to perform deletions as well as insertions, and compared InnoDB to Tokutek’s Fractal TreeTM storage engine, both running on MySQL 5.1. I’ll post the revised iiBench tarball soon. Here is …

Read More