Home |  MySQL Buzz |  FAQ |  Feeds |  Submit your blog feed |  Feedback |  Archive |  Aggregate feed RSS 2.0 English Deutsch Español Français Italiano 日本語 Русский Português 中文
Previous 30 Newer Entries Showing entries 91 to 120 of 279 Next 30 Older Entries

Displaying posts with tag: TokuView (reset)

Presenting at tomorrow’s NoVA MySQL Meetup (DC Area)
+1 Vote Up -0Vote Down

At tomorrow’s NoVA MySQL October Meetup, I will give a talk: “Fractal Tree Indexes – Theoretical Overview and Customer Use Cases.” The meetup is 7 pm Tuesday, October 23, 2012, and will be held at AOL Campus HQ in Dulles VA.

Most databases employ B-trees to achieve a good tradeoff between the ability to update data quickly and to search it quickly. It turns out that B-trees are far from the optimum in this tradeoff space. This led to the development at MIT, Rutgers and Stony Brook of Fractal Tree® indexes. Fractal Tree indexes improve MySQL® scalability and query performance by allowing greater insertion rates, supporting rich indexing and offering

  [Read more...]
My Talk Next Week at HighLoad++
+2 Vote Up -0Vote Down

Next week I’ll be visiting Moscow to talk at Highload++. The conference will take place during Monday 22nd and Tuesday 23rd at the Radisson hotel. I will be giving my personal version of an indexing talk that my colleagues have given in meetups and conferences in the US.

Highload++ conference is targeted to address the issues of complex high traffic web properties. Most of these sites depend on databases to deliver their content, record the traffic and report the application activities in real time. As I learned early in my career at MySQL, the database schema and in particular the indexing strategy, are critical to achieve the highest possible performance out of the

  [Read more...]
Presenting “MongoDB and Fractal Tree Indexes” at MongoDB Boston 2012
+0 Vote Up -1Vote Down

I’ll be presenting “MongoDB and Fractal Tree Indexes” at MongoDB Boston 2012 on October 24th.  My presentation covers the basics of B-trees and Fractal Tree Indexes, the benchmarks we’ve run so far, and the development road map going forward.

I’ve been to this one day conference twice now and both times came away with a better understanding of MongoDB’s capabilities, use-cases, and many questions answered via their deep technical dives.  I highly recommend current MongoDB users and anyone considering a MongoDB project attend – it appears that seats are still available.

Report on XLDB Tutorial on Data Structures and Algorithms
+0 Vote Up -0Vote Down

Bradley and I (Michael) gave the tutorial on Data Structures and Algorithms for Big Databases at the 6th XLDB Conference last month.

The tutorial was organized as follows:

  • Module 0: Tutorial overview and introductions. We describe an observed (but not necessary) tradeoff in ingestion, querying, and freshness in traditional database.
  • Module 1: I/O model and cache-oblivious analysis.
  • Module 2: Write-optimized data structures. We give the optimal trade-off between inserts
  [Read more...]
First of New NSF Big Data Grants Go to Tokutek Founders
+0 Vote Up -0Vote Down

The core technology behind Tokutek is based on the academic research by our founders: Michael Bender, Bradley Kuszmaul and Martin Farach-Colton.  They are all still in academia, in addition to their work at Tokutek.

Back in March, the White House kicked off a new Initiative for Big Data.  Last week, the National Science Foundation announced the first interagency grants for this.  Eight awards were given, and our own Michael Bender and Martin Farach-Colton, along with Robert Johnson of Stony Brook University, received one of

  [Read more...]
ODBMS Interview: Scaling MySQL and MariaDB to TBs
+2 Vote Up -0Vote Down

Recently, our CTO, Martín Farach-Colton had a chance to talk about scaling MySQL and MariaDB with Roberto Zicari of ODBMS.

In the article, Martin states “While I believe that one size fits most, claims that RDBMS can no longer keep up with modern workloads come in from all directions. When people talk about performance of databases on large systems, the root cause of their concerns is often the performance of the underlying B-tree index.” He also notes how “Fractal Tree Indexes put you on a higher-performing tradeoff curve. Query-optimal write-optimized indexing is all about making general-purpose databases faster. For some of our customers’ workloads,

  [Read more...]
Forbes: “Tokutek Makes Big Data Dance”
+1 Vote Up -0Vote Down

Recently, our CEO, John Partridge had a chance to talk about novel database technologies for “Big Data” with Peter Cohan of Forbes.

According to the article, “Fractal Tree indexing is helping organizations analyze big data more efficiently due to its ability to improve database efficiency thanks to faster ‘database insertion speed, quicker input/output performance, operational agility, and data compression.’” As a start-up based on “the  first algorithm-based breakthrough in the database world in 40 years,” Toktuetek is following in the footsteps of firms such as Google and RSA, which also relied on novel algortithm advances as core to their technology.

To read the full article, and

  [Read more...]
Webinar: Introduction to TokuDB v6.5
+1 Vote Up -0Vote Down

TokuDB® is a proven solution that scales MySQL® and MariaDB® from GBs to TBs with unmatched insert and query speed, compression, replication performance and online schema flexibility. Tokutek’s recently launched TokuDB v6.5 delivers all of these features and more, not just for HDDs, but also for flash memory.

Originally Aired: October 10th
AVAILABLE ON DEMAND

TokuDB v6.5:

  • Stores 10x More Data – TokuDB delivers 10x compression without any performance degradation. Users can therefore take advantage of much greater amounts of available space without paying more for additional storage.
  • Delivers High Insertion Speed – TokuDB

  [Read more...]
Percona Live New York Wrap-Up
+0 Vote Up -0Vote Down

Tokutek sponsored the Percona Live MySQL / New York 2012 Conference which took place this past Monday and Tuesday.  I spent much of the time at our booth discussing TokuDB with conference attendees but also managed to attend the following presentations:

  [Read more...]
MySQL Schema Agility on SSDs
+1 Vote Up -0Vote Down

TokuDB v6.5 adds the ability to expand certain column types without downtime.  Users can now enlarge char, varchar, varbinary, and integer columns with no interruption to insert/update/delete statements on the altered table.  Prior to this feature, enlarging one of these column types required a full table rebuild.  InnoDB blocks all insert/update/delete operations to a table during column expansion as it rebuilds the table and all indexes.

We recently added SSDs to our existing servers (HP DL380 servers with internal RAID arrays).  I opted for LSI controllers (LSI 9285-8e and LSI 9280-4i4e), Samsung 830 SSDs, and a Sans Digital AccuRaid AS108X enclosure.  I was unable to locate much in the way of optimizing Linux for SSD/RAID performance and plan on blogging my findings in the future.  However, the out of the box performance is seriously fast.

I was curious to see how

  [Read more...]
Three Ways that Fractal Tree Indexes Improve SSD for MySQL
+1 Vote Up -0Vote Down

Since Fractal Tree indexes turn random writes into sequential writes, it’s easy to see why they offer a big advantage for maintaining indexes on rotating disks. It turns out that that Fractal Tree indexing also offers signficant advantages on SSD. Here are three ways that Fractal Trees improve your life if you use SSDs.

Advantage 1: Index maintenence performance.

The results below show the insertion of 1 billion rows into a table while maintaining three multicolumn secondary indexes. At the end of the test, TokuDB’s insertion rate remained at 14,532 inserts/second whereas InnoDB had dropped to 1,607 inserts/second. That’s a difference of over 9x.

Platform: Centos 5.6; 2x Xeon L5520; 72GB RAM; LSI  [Read more...]
Announcing TokuDB v6.5: Optimized for Flash
+2 Vote Up -0Vote Down

We are excited to announce TokuDB® v6.5, the latest version of Tokutek’s flagship storage engine for MySQL and MariaDB.

This version offers optimization for Flash as well as more hot schema change operations for improved agility.

We’ll be posting more details about the new features and performance, so here’s an overview of what’s in store.

Flash TokuDB v6.5 continues the great Toku-tradition of fast insertions. On flash drives, we show an order-of-magnitude (9x) faster insertion rate than InnoDB. TokuDB’s standard compression works just as well on flash and helps you get the most out of your  [Read more...]
Tokutek CEO Named Innovation All Star
+1 Vote Up -0Vote Down

On Friday our CEO John Partridge was named a “Tech Luminary” in the 17th annual Innovation All Stars award, which is given jointly by Mass High Tech (MHT) and the Boston Business Journal (BBJ). As noted in MHT by the editor, Chris McIntosh, the Luminary designations “reflect deep accomplishment in various technology-related industries.”

For more than 20 years, Tokutek CEO John Partridge has worked with startups in both the Boston area and in Silicon Valley. He joined Tokutek from StreamBase Systems which John co-founded with

  [Read more...]
Strange Loop Talk on Indexing
+0 Vote Up -0Vote Down

At next week’s Strange Loop conference, I will give a talk on “Understanding Indexing”. The session is 10 am Monday, September 24th, and will be held in the Midland States Room.

Application performance often depends on how fast a query can respond and query performance almost always depends on good indexing. So one of the quickest and least expensive ways to increase application performance is to optimize the indexes. This talk presents three simple and effective rules on how to construct indexes around queries that result in good performance.

This is a general discussion applicable

  [Read more...]
Looking for MongoDB users to test Fractal Tree Indexing
+1 Vote Up -0Vote Down

In my three previous blogs I wrote about our implementation of Fractal Tree Indexes on MongoDB, showing a 10x insertion performance increase, a 268x query performance increase, and a comparison of covered indexes and clustered indexes. The benchmarks show the difference that rich and efficient indexing can make to your MongoDB workload.

It’s one thing for us to benchmark MongoDB + TokuDB and another to measure real world performance. If you are looking for a way to improve the performance or

  [Read more...]
XLDB Tutorial on Data Structures and Algorithms
+0 Vote Up -0Vote Down

Next week Michael and I (Bradley) will be travelling to Silicon Valley to present a tutorial on Data Structures and Algorithms for Big Databases at the 6th XLDB Conference.

The tutorial, which is 4 hours on Monday afternoon, aims to cover the following topics (but it’s looking like we’ll have to drop several items for lack of time.)

This tutorial will explore data structures and algorithms for big databases. The topics include:

  • Data structures including B-trees, Log Structured Merge Trees, and Streaming B-trees.
  • Approximate Query Membership data structures including Bloom filters and cascade filters.
  • Algorithms for join including hash joins and
  [Read more...]
MongoDB Index Shootout: Covered Indexes vs. Clustered Fractal Tree Indexes
+1 Vote Up -0Vote Down

In my two previous blogs I wrote about our implementation of Fractal Tree Indexes on MongoDB, showing a 10x insertion performance increase and a 268x query performance increase. MongoDB’s covered indexes can provide some performance benefits over a regular MongoDB index, as they reduce the amount of IO required to satisfy certain queries.  In essence, when all of the fields you are requesting are present in the index key, then MongoDB does not have to go back to the main storage heap to

  [Read more...]
268x Query Performance Increase for MongoDB with Fractal Tree Indexes, SAY WHAT?
+1 Vote Up -0Vote Down

Last week I wrote about our 10x insertion performance increase with MongoDB. We’ve continued our experimental integration of Fractal Tree® Indexes into MongoDB, adding support for clustered indexes.  A clustered index stores all non-index fields as the “value” portion of the index, as opposed to a standard MongoDB index that stores a pointer to the document data.  The benefit is that indexed lookups can immediately return any requested values instead of needing to do an additional lookup (and potential disk IOs) for the requested fields.

To create a clustered index you just need to add

  [Read more...]
10x Insertion Performance Increase for MongoDB with Fractal Tree Indexes
+3 Vote Up -0Vote Down

The challenge of handling massive data processing workloads has spawned many new innovations and techniques in the database world, from indexing innovations like our Fractal Tree® technology to a myriad of “NoSQL” solutions (here is our Chief Scientist’s perspective). Among the most popular and widely adopted NoSQL solutions is MongoDB and we became curious if our Fractal Tree indexing could offer some advantage when combined with it. The answer seems to be a strong “yes”.

Earlier in the summer we kicked off a small side project and here’s what we did: we implemented a “version 2” IndexInterface as a Fractal Tree index and ran some benchmarks. Note that our integration only affects MongoDB’s secondary indexes;

  [Read more...]
Webinar: Introduction to TokuDB
+1 Vote Up -0Vote Down

Businesses increasingly operate in a 24×7 environment, where complex analytics must be performed on live, continuously incoming “Big Data.” To address this, TokuDB has developed Fractal Tree®  technology, a revolutionary new indexing capability that enables SQL databases running advanced web applications to grow from gigabytes to terabytes while improving insert speed, query performance, compression, and enabling zero-downtime schema changes.

Date: September 5th
Time: 2 PM EST / 11 AM PST

REGISTER TODAY

TokuDB is used by MySQL and MariaDB customers worldwide to increase their database performance by 20x-80x on Big Data applications that conventional RDBMS’s cannot handle. Instead


  [Read more...]
FROSCON and VLDB
+2 Vote Up -0Vote Down

Next week I (Bradley) will be traveling to FROSCON near Bonn, Germany, and then on to VLDB in Istanbul.

At FROSCON I’ll be talking about fast data structures for maintaining indexes. The talk will share some content with my upcoming MySQL Connect talk.

At VLDB, Dzejla Medjedovic will be presenting a talk on our paper on SSD-friendly Bloom-filter-like data structures. The paper is

Michael A. Bender, Martin Farach-Colton, Rob Johnson, Russell Kraner, Bradley C. Kuszmaul, Dzejla Medjedovic, Pablo Montes, Pradeep Shetty, Richard P. Spillane, and Erez Zadok.
Don’t Thrash: How to Cache Your Hash on Flash. PVLDB 5(11):1627-1637, 2012.

An earlier version of the paper appeared at


  [Read more...]
Dagstuhl Seminar on Database Workload Management
+1 Vote Up -0Vote Down

A few weeks ago Bradley Kuszmaul and I attended the Dagstuhl Seminar on Database Workload Management.

The Dagstuhl computer science research center is (remotely) located in the countryside in Saarland, Germany. The actual building is an 18th Century Manor House, first retooled as an old-age home, and then a computer science research center. Workshop participants typically spend the whole week talking and working together.

Dagstuhl Computer Science Center

Shivnath Babu (Duke University), Goetz Graefe (Hewlett Packard),

  [Read more...]
Real World Compression
+1 Vote Up -0Vote Down

Benchmarking is a tricky thing, especially when it comes to compression. Some data compresses quite well while other data does not compress at all. Storing jpeg images in a BLOB column produces 0% compression, but storing the string “AAAAAAAAAAAAAAAAAAAA” in a VARCHAR(20) column produces extremely high (and unrealistic) compression numbers.

This week I was assisting a TokuDB customer understand the insertion performance of TokuDB versus InnoDB and MyISAM for their actual data. The table contained a single VARCHAR(50), multiple INTEGER, one SET, one DECIMAL, and a surrogate primary key.  To support a varied query workload they needed 6 indexes.

Here is an obfuscated schema of the table:

col1 varchar(50) NOT NULL,
col2 int(40) NOT NULL DEFAULT '0',
col3 int(10) NOT NULL DEFAULT '0',
col4 int(10) NOT NULL DEFAULT '0',
col5 int(10) NOT NULL DEFAULT '0',
col6
  [Read more...]
Thursday’s Emerging Business Technology Meetup in Boston
+0 Vote Up -0Vote Down

I’ll be presenting TokuDB at the Emerging Business Technology Meetup in Boston this Thursday night at 6pm at 290 Congress St (near South Station).  The meeting topic is “NewSQL: SQL Technologies Keeping NoSQL Promises” and also includes presentations from Akiban and VoltDB.  Each of us will be highlighting our technology and use-cases, with a panel discussion and open Q&A to follow.

This is a well attended group with 102 currently registered for the meeting and room for 48 more.  If you

  [Read more...]
Webinar: Understanding Indexing
+1 Vote Up -0Vote Down

Three rules on making indexes around queries to provide good performance

Application performance often depends on how fast a query can respond and query performance almost always depends on good indexing. So one of the quickest and least expensive ways to increase application performance is to optimize the indexes. This talk presents three simple and effective rules on how to construct indexes around queries that result in good performance.


Time: 2PM EDT / 11AM PDT

This webinar is a general discussion applicable to all databases using indexes and is not specific to any particular MySQL® storage engine


  [Read more...]
Announcing TokuDB v6.1
+3 Vote Up -0Vote Down

TokuDB v6.1 is now generally available and can be downloaded here.

New features include:

  • Added support for MariaDB 5.5 (5.5.25)
    • The TokuDB storage engine is now available with all the additional functionality of MariaDB 5.5.
  • Added HCAD support to our MySQL 5.5 version (5.5.24)
    • Hot column addition/deletion was present in TokuDB v6.0 for MySQL 5.1 and MariaDB 5.2, but not in MySQL 5.5.  This feature is now present in all MySQL and MariaDB versions of TokuDB.
  • Improved in-memory point query performance via lock/latch refinement
    • TokuDB has always been a great performer on range scans and workloads where the size of the working data set is significantly larger than RAM.  TokuDB v6.0 improved the performance of in-memory point queries at
  [Read more...]
How We Spent a Tuesday Fixing a MySQL Replication Bug
+3 Vote Up -0Vote Down

We found a simple XA transaction that crashes MySQL 5.5 replication. This simple transaction inserts a row into an InnoDB table and a TokuDB table. The bug was caused by a flaw in the logging code exposed by the transaction’s use of two XA storage engines (TokuDB and InnoDB). This bug was fixed in the TokuDB 6.0.1 release.

Here are some details.  Suppose that a database contains the following tables.

create table t1 (a int) engine=InnoDB
create table t2 (a int) engine=TokuDB

 The following transaction

begin
insert into t1 values (1)
insert into t2 values (2)
commit

causes the replication slave to crash.

The crash occurs when mysqld tries to dereference a NULL pointer.

#4  0x000000000088e203 in MYSQL_BIN_LOG::log_and_order (this=0x14b8640, thd=0x7f7758000af0, xid=161, all=true,





  [Read more...]
My Talks at MySQL Connect and Percona Live NYC
+1 Vote Up -0Vote Down


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 deletions, and updates; adding and removing columns online; adding indexes online; preventing slave lag; and compressing data effectively.

This session shows why some of these challenges are difficult to solve with storage engines based on B-trees, how Fractal Tree® data structures work, and why they can help solve these problems. Tokutek sells a transaction-safe Fractal Tree storage engine for MySQL, but the presentation is primarily about the underlying technology. It includes a discussion of both the theoretical and practical aspects of Fractal Tree indexes.

I have the privilege of being able to give


  [Read more...]
Balada Para Un Loco – A Review of the MySQL, NoSQL, and Cloud Conference
+1 Vote Up -0Vote Down

… Ya se que estás piantao, piantao, piantao…

For my lastest blog, a review of the MySQL, NoSQL and Cloud Conference, I’ll continue to use the tango metaphor. Balada para un loco (ballad for a crazy one) is a Piazzola classic and explains what I think of Santiago Lertora from Binlogic for single handedly putting together this event; he had to be piantao (slang for ‘crazy’) to pursue his vision to kick start the Open Source database community in South America into becoming as active as it is in the US and Europe. He was able to gather some renowned speakers such as our own Martin Farach-Colton, Sheeri Cabral from Mozilla, Max Mether and Massimo Brignoli from SkySQL, Colin Charles from Monty Program, Alejandro Kojima

  [Read more...]
How to Stop Playing “Hop and Seek”: MySQL Cluster and TokuDB, Part 2
+1 Vote Up -0Vote Down

In my last post, I wrote that I observed many similarities between TokuDB and MySQL Cluster. Many features that benefit TokuDB also benefit MySQL Cluster, and vice versa, with Hot Column Addition and Deletion (HCAD) being an example. Over my next few posts, I expand on some more of these possibly unexpected similarities.

Today I want to focus on optimizer support for clustering keys. Both MySQL Cluster and TokuDB can benefit from the MySQL optimizer supporting clustering keys. For TokuDB, the

  [Read more...]
Previous 30 Newer Entries Showing entries 91 to 120 of 279 Next 30 Older Entries

Planet MySQL © 1995, 2014, Oracle Corporation and/or its affiliates   Legal Policies | Your Privacy Rights | Terms of Use

Content reproduced on this site is the property of the respective copyright holders. It is not reviewed in advance by Oracle and does not necessarily represent the opinion of Oracle or any other party.