About Me

Michael S. Kester, PhD Candidate

Mike with Sarah (3hr) old. I'm in the fourth year of my Computer Science PhD in the School of Engineering and Applied Sciences (SEAS) at Harvard where I am advised by Stratos Idreos as a member of DASlab, the Data Systems Laboratory. In general, I haven't met a part of computer science that I don't like but my current research is focused on innovative data system architectures and software.

Prior to Harvard, I worked as a software engineer at athenahealth, and before my career in technology, I cooked and tended bar professionally.

A recent CV.

Projects

Access Path Selection In Modern Data Systems

Access path selection has always been a key component of database systems. Having the choice between a secondary index scan and a scan of the base data allows systems to utilize the best possible access path by taking into account run-time characteristics at optimization time. A scan over the base data has to scan everything while a secondary index scan only has to access an auxiliary copy of the data which is smaller and has more structure. Secondary indexes, typically in the form of B+-Trees, have been extensively used in row-oriented systems to access the desired values, with neither the overhead of reading the unneeded values nor their associated neighboring attributes. The decision of access path selection is typically based on a fixed selectivity threshold which accounts for the idiosyncrasies of the specific database system, its access path design, and its hardware properties.

This project seeks to understand the trade offs between access paths in modern systems. In particular, the way the choice between access paths changes as software is optimized and new hardware is introduced.

More

RUM Aware Data Structures

The database research community has been building methods to store, access, and update data for more than four decades. Throughout the evolution of the structures and techniques used to access data, access methods adapt to the ever changing hardware and workload requirements. Today, even small changes in the workload or the hardware lead to redesigning access methods. This phenomenon has reached its peak as data generation and workload diversification grow exponentially, and hardware advances introduce increased complexity. New workload requirements are introduced by the emergence of new applications, and data is managed by large systems composed of more and more complex and heterogeneous hardware. As a result, it is increasingly important to develop application-aware and hardware-aware access methods.

More

Publications

2016

Athanassoulis M, Kester MS, Maas L, Idreos S. "Designing Access Methods: The RUM Conjecture", (EDBT 16). Bordeaux, France.

pdf bibtex

2014

Kate B, Kohler E, Kester MS, Narula N, Mao Y, Morris R. "Easy Freshness with Pequod Cache Joins", in 11th USENIX Symposium on Networked Systems Design and Implementation (NSDI 14). Seattle, WA: USENIX Association; 2014:415–428.

pdf bibtex

2011

Lee JW, Kester MS, Schulzrinne H. "Follow the River and You Will Find the C", in Proceedings of the 42Nd ACM Technical Symposium on Computer Science Education (SIGCSE 11). New York, NY, USA: ACM; 2011:411–416.

pdf bibtex

Contact

Michael S. Kester

Harvard SEAS - DASlab
Maxwell Dworkin
33 Oxford Street
Cambridge, MA 02138
kester@eecs.harvard.edu


This page was last updated on Mon Jan 11 17:41:29 EST 2016.
Copyright © 2015-2016 Michael S. Kester. All rights reserved.