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 […]
Read MoreNext 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 […]
Read MoreNext 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 […]
Read MoreSolving 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 […]
Read MoreMany database management tasks become difficult as you move from millions of rows and gigabytes of data to billions of rows and terabytes of data. Such tasks include ingesting data while maintaining indexes; changing schemas without downtime; and supporting connections, replication, and backup. For some scaling problems (connections and replication), MySQL® is better […]
Read MoreChallenges of Big Databases with MySQL Many database management tasks become difficult as you move from millions of rows and gigabytes of data to billions of rows and terabytes of data. Such tasks include ingesting data while maintaining indexes; changing schemas without downtime; and supporting connections, replication, and backup. For some scaling problems […]
Read MoreThe MySQL council is looking for candidates for 2012. Based on community feedback, this will be an open nomination process (and you can nominate yourself). The MySQL council advocates for the MySQL community, and needs community leaders to help address issues such as keeping the bug database open and keeping the user conference from fragmenting. […]
Read MoreI’ll be talking about How Fractal Trees Work today at MIT in the Computational Research In Boston and Beyond (CRIBB) seminar (http://www-math.mit.edu/crib/2011/nov4.html). The talk is at 12:30 in the Stata Center room 32-141. Pizza available before. This talk will be academically-oriented (not much marketing). The abstract is as follows: Most storage systems employ B-trees to achieve […]
Read MoreMany database management tasks become difficult as you move from millions of rows and gigabytes of data to billions of rows and terabytes of data. Such tasks include ingesting data while maintaining indexes; changing schemas without downtime; and supporting connections, replication, and backup. For some scaling problems (connections and replication), MySQL® is better than most […]
Read MoreChallenges of Big Databases with MySQL Many database management tasks become difficult as you move from millions of rows and gigabytes of data to billions of rows and terabytes of data. Such tasks include ingesting data while maintaining indexes; changing schemas without downtime; and supporting connections, replication, and backup. For some scaling problems […]
Read More