• Publications
  • Influence
Monkey: Optimal Navigable Key-Value Store
TLDR
We present Monkey, an LSM-based key-value store that strikes the optimal balance between lookup cost, update cost, and main memory footprint, yet all existing designs expose a suboptimal and difficult to tune trade-off among these metrics. Expand
  • 81
  • 6
  • PDF
Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging
TLDR
We show that Lazy Leveling improves the worst-case cost complexity of updates while maintaining the same bounds on point lookup Cost, long range lookup cost, and space-amplification. Expand
  • 43
  • 5
  • PDF
Data Canopy: Accelerating Exploratory Statistical Analysis
TLDR
We address this challenge in Data Canopy, where descriptive and dependence statistics are synthesized from a library of basic aggregates. Expand
  • 32
  • 4
  • PDF
EagleTree: Exploring the Design Space of SSD-Based Algorithms
TLDR
Solid State Drives are a moving target for system designers: they are black boxes, their internals are undocumented, and their performance characteristics vary across models. Expand
  • 22
  • 3
  • PDF
The Log-Structured Merge-Bush & the Wacky Continuum
TLDR
Data-intensive key-value stores based on the Log-Structured Merge-Tree are used in numerous modern applications ranging from social media and data science to cloud infrastructure. Expand
  • 12
  • 2
  • PDF
Optimal Bloom Filters and Adaptive Merging for LSM-Trees
TLDR
We present Monkey, an LSM-tree based key-value store that strikes the optimal balance between the costs of updates and lookups with any given main memory budget. Expand
  • 23
  • 1
  • PDF
Design Continuums and the Path Toward Self-Designing Key-Value Stores that Know and Learn
TLDR
This article is published under a Creative Commons Attribution License (http://creativecommons.org/licenses/by/3.0/), which permits distribution and reproduction in any medium as well allowing derivative works, provided that you attribute the original work to the author(s). Expand
  • 22
  • 1
  • PDF
GeckoFTL: Scalable Flash Translation Techniques For Very Large Flash Devices
TLDR
We propose a page-associative FTL called GeckoFTL, whose central innovation is replacing PVB with a new data structure called Logarithmic Gecko. Expand
  • 15
  • 1
  • PDF
Rosetta: A Robust Space-Time Optimized Range Filter for Key-Value Stores
TLDR
We introduce Rosetta, a probabilistic range filter designed specifically for LSM-tree based key-value stores. Expand
  • 2
  • 1
  • PDF
Coconut: A Scalable Bottom-Up Approach for Building Data Series Indexes
TLDR
We show that the state-of-the-art data series indexes that are used for this purpose do not scale well for massive datasets in terms of performance, or storage costs. Expand
  • 31
  • PDF