ANVIL: An In-Storage Accelerator for Name–Value Data Stores

Ryan Wong, Nikita Kim, Aniket Das, Kevin Higgs, Engin Ipek, Sapan Agarwal, Saugata Ghose, Ben Feinberg
International Symposium on Computer Architecture (ISCA), 2025

Abstract

Name–value pairs (NVPs) are a widely-used abstraction to organize data in millions of applications. At a high level, an NVP associates a name (e.g., array index, key, hash) with each value in a collection of data. Specific NVP data store formats can vary widely, ranging from simple arrays/dictionaries and lookup tables to key–value stores and data mining workloads. Despite their importance, existing optimizations for NVPs are limited to only a single data store format, as the broad definition of NVPs allows for significant heterogeneity in encoding and implementation.

We propose ANVIL, the first end-to-end system that allows programmers to broadly accelerate most formats of NVPs. With a conventional solid-state drive (SSD), large-scale NVP lookups can saturate both external and internal SSD bandwidth, as every NVP in the data store needs to be sent back to the host CPU to check for a matching name. ANVIL makes use of in-storage processing to avoid reading out any data for names that do not match, by performing name match checks directly inside the SSD’s NAND flash chips. We demonstrate that ANVIL can substantially reduce disk I/O, reduce metadata overheads, and provide speedups of 4.0 ×, 25 ×, and 14.6% over a conventional SSD, for three different NVP workloads (database transactions, analytics, and graph processing).

BibTeX

@inproceedings{wong2025anvil,
  author    = {Ryan Wong and Nikita Kim and Aniket Das and Kevin Higgs and Engin Ipek and Sapan Agarwal and Saugata Ghose and Ben Feinberg},
  title     = {{ANVIL: An In-Storage Accelerator for Name--Value Data Stores}},
  booktitle = {International Symposium on Computer Architecture (ISCA)},
  year      = {2025},
  month     = {jun},
  address   = {Tokyo, Japan},
  doi       = {10.1145/3695053.3731000}
}

← All papers