Emergency

Search Results for: mysql fast deletion

‘Indexing’ JSON documents for efficient MySQL queries over JSON data

MySQL meets NoSQL with JSON UDF I recently got back from FOSDEM, in Brussels, Belgium. While I was there I got to see a great talk by Sveta Smirnova, about her MySQL 5.7 Labs release …

Read More
 

Q&A: Even More Deadly Mistakes of MySQL Development

On Wednesday I gave a presentation on “How to Avoid Even More Common (but Deadly) MySQL Development Mistakes” for Percona MySQL Webinars.  If you missed it, you can still register to view the recording and my slides. Thanks …

Read More
 

My Talks at MySQL Connect and Percona Live NYC

Solving the Challenges of Big Databases with MySQL When you’re using MySQL for big data (more than ten times as large as main memory), these challenges often arise: loading data fast; maintaining indexes under insertions …

Read More
 

Announcing TokuDB v5.2: Improved Multi-Client Scaling and Faster Queries

TokuDB® v5.2, the latest version of Tokutek’s flagship storage engine for MySQL and MariaDB, is now available. This version offers performance enhancements over previous releases, especially for multi-client scale up and point queries, and extends …

Read More
 

Hot Column Addition and Deletion Part II: How it works

Hot Column Addition and Deletion (HCAD) In the previous HCAD post, I described HCAD and showed that it can reduce the downtime of column addition (or deletion) from 18 hours to 3 seconds. In fact, …

Read More
 

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
 

MySQL Partitioning: A Flow Chart

In Part 1, and Part 2 of this series, I presented some thoughts on partitioning. I heard some great feedback on why people use partitioning. Here, I present a flow chart that summarizes what I’ve …

Read More
 

Making “Replace Into” Fast, by Avoiding Disk Seeks

In this post two weeks ago, I explained why the semantics of normal ad-hoc insertions with a primary key are expensive because they require disk seeks on large data sets. Towards the end of the …

Read More
 

Making Updates Fast, by Avoiding Disk Seeks

The analysis that shows how to make deletions really fast by using clustering keys and TokuDB’s fractal tree based engine also applies to make updates really fast. (I left it out of the last post …

Read More
 

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 …

Read More