We present the Succinct Range Filter (SuRF), a fast and compact data structure for approximate membership tests.
Huanchen Zhang, Hyeontaek Lim, Viktor Leis, David G. Andersen, Michael Kaminsky, Kimberly Keeton, Andrew Pavlo From Communications of the ACM | April 2021
This paper presents a fast array of wimpy nodes — FAWN — an approach for achieving low-power data-intensive data-center computing.
David G. Andersen, Jason Franklin, Michael Kaminsky, Amar Phanishayee, Lawrence Tan, Vijay Vasudevan From Communications of the ACM | July 2011
