Percona Resources

Software
Downloads

All of Percona’s open source software products, in one place, to download as much or as little as you need.

Valkey Contribution

Product Documentation

Why Percona for MongoDB?

Why Percona for PostgreSQL?

Percona Blog

Percona Blog

Our popular knowledge center for all Percona products and all related topics.

Community

Percona Community Hub

A place to stay in touch with the open-source community

Events

Percona Events Hub

See all of Percona’s upcoming events and view materials like webinars and forums from past events

About

About Percona

Percona is an open source database software, support, and services company that helps make databases and applications run better.

Percona in the News

See Percona’s recent news coverage, press releases and industry recognition for our open source software and support.

Our Customers

Our Partners

Careers

Contact Us

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 to keep the story simple). As a quick example, let’s look at...

Disk seeks are evil, so let’s avoid them, pt. 4

Continuing in the theme from previous posts, I’d like to examine another case where we can eliminate all disk seeks from a MySQL operation and therefore get two orders-of-magnitude speedup. The general outline of these posts is: B-trees do insertion disk seeks....

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...

Disk seeks are evil, so let’s avoid them, pt. 2

In part 1, I discussed why having many disk seeks are bad (they slow down performance), and how 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...

OpenSQL Camp Boston 2010

OpenSQL Camp Boston 2010 will be held at the Stata Center in Cambridge, Massachusetts, October 15-17, 2010. The Stata Center was designed by Frank Gehry and was completed in 2005. The Stata Center houses CSAIL (The MIT Computer Science and Artifical Intelligence...

Joining on range? Wrong!

The problem I am going to describe is likely to be around since the very beginning of MySQL, however unless you carefully analyse and profile your queries, it might easily go unnoticed. I used it as one of the examples in our talk given at phpDay.it conference last...

OpenSQL (2009 Portland) talk on an Open Storage Engine API

I just spotted the youtube video of my OpenSQL Camp (Portland 2009) talk on An Open Storage Engine API. I talked about some of technical issues for implementing storage engines across many SQL front ends, not just MySQL. You can find this talk and other mostly...

What is a Performance Model for SSDs?

Here are the slides and video for my MySQL UC ignite talk on measuring the performance of SSDs. You can find this talk and other mostly technical material here. This research was funded in part by the National Science Foundation.

Fractal Tree Video from OpenSQL Camp (Portland in 2009)

I recently discovered that there’s a youtube video of the talk I gave at OpenSQL Camp in Portland in 2009. This is a whiteboard presentation and is less well developed than the talk I gave a the MySQL conference (I posted those slides two days ago. But since it...

Tokutek MySQL UC Talks

I (Bradley C. Kuszmaul) am presenting two talks at the MySQL User Conference. The first talk is a 5-minute talk at tonight’s Ignite MySQL session organized by Brian Aker. I’ll present some performance measurements on the Intel X25E SSD. The bottom line is...

Customer Success Story: KAYAK uses ad hoc indexing

Fast insertion – what Tokutek excels at – isn’t only important for handling high data rates. It also enables a new way to extract value from an existing database called ad hoc indexing. KAYAK has a billion rows stored in TokuDB and adding an index...

See us at the O’Reilly MySQL Conference & Expo

At this year’s O’Reilly MySQL Conference we will be showing the latest version of our MySQL storage engine, TokuDB v3.1. Come visit us at Table T1 in the OEM section of the Exhibit Hall. We will be talking about how TokuDB can dramatically improve...

Announcing TokuDB v3.1

Tokutek is pleased to announce immediate availability of TokuDB for MySQL, version 3.1. It is designed for continuous querying and analysis of large volumes of rapidly arriving and changing data, while maintaining full ACID properties. TokuDB v3.1’s new...

The 451 Group reports on TokuDB v3.0 for MySQL

Matt Aslett over at The 451 Group has written a Market Development report entitled “Tokutek delivers ACID transaction support with TokuDB version 3.0.” Get the full report and you can try out The 451 Group’s services for free by visiting...

Community Events February-March

February and March as busy months for Community events.  There’s MySQL University, Fosdem, the Seattle MySQL Meetup & Confoo.ca. Here are the details: February 4th – I’ll be presenting a talk via MySQL University on Optimizing Queries with...