Both these problems are instances of issues with schema evolution: what happens when the structure of your structured data changes. Rather than taking a prescriptive approach, Alex Rasmussen distills a lot of institutional knowledge and computer science history into a set of patterns and examines the trade-offs between them.
Unfortunately, I don't have a good recording of this talk. Slides on SlideShare.
EarthBound, a role-playing game released for the Super Nintendo in 1994, is one of the most universally revered games of all time. At the core of EarthBound is a super-complex scripting language that controls text, scripted cutscenes, music, sound effects, window management, and more. In this talk, we’ll explore some of the language’s more interesting or charming features.
In the past five years, I have spent a lot of time trying to get high-integrity data out of spreadsheets and into databases. In this talk, I explore common data integrity problems when dealing with spreadsheet data, investigate whether those integrity problems are inescapable, and share ongoing work to mitigate them.
This talk examines some lessons learned while building record-setting sorting systems at UC San Diego, and how understanding your hardware, architecting for experimentation, and re-examining your assumptions can make building high-performance systems easier.
Video and slides are available on InfoQ.
In January 2015, I gave a talk at Papers We Love, a meetup in San Francisco for engineers who like talking about computer science research. The talk focuses on Flat Datacenter Storage and the example it can set for system designers.
My talk was preceded by a lightning talk by Sargun Dhillon on VL2. It's useful background; if you'd like to watch that talk, rewind the video to the beginning.