Cuckoo Trie: Exploiting Memory-Level Parallelism for Efficient DRAM Indexing

Adar Zeitak, Adam Morrison

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present the Cuckoo Trie, a fast, memory-efficient ordered index structure. The Cuckoo Trie is designed to have memory-level parallelism - -which a modern out-of-order processor can exploit to execute DRAM accesses in parallel - - without sacrificing memory efficiency. The Cuckoo Trie thus breaks a fundamental performance barrier faced by current indexes, whose bottleneck is a series of dependent pointer-chasing DRAM accesses - -e.g., traversing a search tree path - - which the processor cannot parallelize. Our evaluation shows that the Cuckoo Trie outperforms state-of-the-art-indexes by up to 20%-360% on a variety of datasets and workloads, typically with a smaller or comparable memory footprint.

Original languageEnglish
Title of host publicationSOSP 2021 - Proceedings of the 28th ACM Symposium on Operating Systems Principles
Pages147-162
Number of pages16
ISBN (Electronic)9781450387095
DOIs
StatePublished - 26 Oct 2021
Event28th ACM Symposium on Operating Systems Principles, SOSP 2021 - Virtual, Online, Germany
Duration: 26 Oct 202129 Oct 2021

Publication series

NameSOSP 2021 - Proceedings of the 28th ACM Symposium on Operating Systems Principles

Conference

Conference28th ACM Symposium on Operating Systems Principles, SOSP 2021
Country/TerritoryGermany
CityVirtual, Online
Period26/10/2129/10/21

Keywords

  • MLP
  • index
  • memory-level parallelism
  • trie

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Software

Fingerprint

Dive into the research topics of 'Cuckoo Trie: Exploiting Memory-Level Parallelism for Efficient DRAM Indexing'. Together they form a unique fingerprint.

Cite this