Jump to content

TokuDB

From Wikipedia, the free encyclopedia

This is the current revision of this page, as edited by Liz (talk | contribs) at 22:57, 23 March 2023 (Removing link(s) Wikipedia:Articles for deletion/TokuMX closed as soft delete (XFDcloser)). The present address (URL) is a permanent link to this version.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
TokuDB
Developer(s)Percona
Stable release
7.5.5[1] / January 29, 2015[citation needed]
Repository
TypeDatabase engine
LicenseGNU General Public License (version 2)[2]
WebsitePercona TokuDB

TokuDB is an open-source, high-performance storage engine for MySQL and MariaDB. It achieves this by using a fractal tree index. It is scalable, ACID and MVCC compliant, provides indexing-based query improvements, offers online schema modifications, and reduces replication lag for both hard disk drives and flash memory.

TokuDB is included in Percona Server, MariaDB and Nagios based opmon. However, it is deprecated in Percona Server 8 and MariaDB 10.5.

Fractal tree indexes

[edit]

Overview

[edit]

TokuDB uses a Fractal tree index tree data structure that keeps data sorted and allows searches and sequential access in the same time as a B-tree but with insertions and deletions that are asymptotically faster than a B-tree. Fractal trees also allow for messages to be injected into the tree in such a fashion that schema changes (such as adding or dropping a column, or adding an index) can be done online and in the background.[3] As a result, more indexes can be maintained without a drop in performance. This is because adding data to indexes tends to stress the performance of B-trees, but performs well in fractal tree indexes.[4]

Uses

[edit]

Fractal tree indexes can be applied to a number of applications characterized by near-real time analysis of streaming data. They can be used as the storage layer of a database or as the storage layer of a file system. When used in a database, they can be used in any setting where a B-tree is used, with improved performance. Examples include: network event management, online advertising networks, clickstream analytics, and air traffic control management.[5] Other uses include accelerated crawler performance for search engines for social media sites. It can also be used to create indexes and columns online, enabling query flexibility for e-commerce personalization. It is also suited to improving performance and reducing existing loads on transactional websites. In general, it performs well in applications that must simultaneously store log file data and execute ad hoc queries.

Origins

[edit]

This approach to building memory-efficient systems was originally jointly developed by researchers at the Massachusetts Institute of Technology,[6][7] Rutgers University,[8] and the Stony Brook University.[9]

Role on the big data market

[edit]

TokuDB is named as one of the technologies that enable big data in MySQL.[10] Tokutek was a Startup Showcase Finalist at the O'Reilly Strata Conference 2012 on big data.[11]

See also

[edit]

References

[edit]
  1. ^ "Release Notes". Retrieved 2015-10-20.
  2. ^ "Percona Server COPYING". Retrieved 2015-12-17.
  3. ^ "Covering Indexes: Orders-of-Magnitude Improvements" (PDF). Percona. Retrieved 2011-01-17.
  4. ^ "Detailed review of Tokutek storage engine". Percona. Retrieved 2012-02-22.
  5. ^ "Air traffic queries in MyISAM and Tokutek (TokuDB)". MySQL Performance Blog. Retrieved 2011-01-17.
  6. ^ "How TokuDB Fractal Tree Databases Work". O'Reilly. Retrieved 2011-01-17.
  7. ^ "Cache-Oblivious Search Trees Project". Massachusetts Institute of Technology. Retrieved 2011-01-17.
  8. ^ "Cache-Oblivious B-trees" (PDF). Rutgers University. Retrieved 2011-01-17.
  9. ^ "Cache Oblivious B-trees". State University of New York (SUNY) at Stony Brook. Retrieved 2011-01-17.
  10. ^ "Big Data is Creating The Future - It's A $50 Billion Market". Forbes. Retrieved 2012-05-21.
  11. ^ "Strata 2012 Startup Showcase". O'Reilly. Retrieved 2012-05-21.
[edit]