Featured
Percona Products
Percona Services
Use Cases
Michael.BenderBradley 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: […]
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 […]
I attended the NSF Workshop on Research Directions in the Principles of Parallel Computation in Pittsburgh on 6/27/12. The workshop brought together researchers from academia and industry to explore visions for the future of parallel computing. I was one of 17 invited speakers. We were asked to address the question: “what are three big research challenges […]
Martin Farach-Colton and I ran a Tutorial on Algorithms for Memory Sensitive Computing on May 18th at the 44th ACM Symposium on Theory of Computing (STOC) at NYU. Here is the program for the tutorial. Erik Demaine (MIT) spoke on the History of I/O Models. Throughout the years, a remarkable variety of computational models have been proposed to explain the effects of caching, […]
This Saturday afternoon in New York, Martin Farach-Colton and I will run a tutorial on the theoretical foundations of memory sensitive computing to be be held at the 44th ACM Symposium on Theory of Computing (STOC). Here is the program for the tutorial. Topics include history of memory models, geometric computing, string indexing and compression, and, of course, database algorithms. […]
So there I was, gesticulating in front of the chalkboard, lecturing to 120 students. Topic: the beauty of advanced data structures. The door opens and the department chair walks up the aisle onto the stage and comes up to me. 242 eyes follow her progress through the room. She whispers to me that I must […]
Fractal Tree™ indexes are green. They have the potential to be greener still. Here’s why: Remarkably, data centers consume 1-3 percent of all the US electricity. A majority of this power is used to drive servers and storage systems. Significant energy savings remain on the table. Here’s why Fractal Tree indexing enables more energy-efficient storage: […]
Last week I gave a talk entitled “Don’t Thrash: How to Cache your Hash.” The talk took place at the Workshop on Algorithms and Data Structures (ADS) in a medieval castle turned conference center in Bertinoro, Italy. An earlier version of this work (with the same title) appeared at the HotStorage conference in Portland, OR. […]
I gave a talk entitled “How to Index Massive Data Sets Quickly” at the Morrelly Homeland Security Center. The event was hosted at the Long Island Forum for Technology (LIFT) and was jointly supported by NYSTAR and the Stony Brook Sensor CAT. The audience was composed primarily of technologists in the area. While many of […]
On April 9-10 the National Science Foundation hosted the Workshop on the Science of Power Management (SciPM 2009), where I gave an invited talk. Here I give a brief summary of my talk along with a pointer to the slides. The talk describes how MySQL with TokuDB can provide a path to more energy-efficient database […]