Corpus ID: 196471131

Learning Key-Value Store Design

  title={Learning Key-Value Store Design},
  author={Stratos Idreos and Niv Dayan and Wilson Qin and Mali Akmanalp and Sophie Hilgard and A. Ross and J. Lennon and V. Jain and Harshita Gupta and D. Li and Zichen Zhu},
  • Stratos Idreos, Niv Dayan, +8 authors Zichen Zhu
  • Published 2019
  • Computer Science
  • ArXiv
  • We introduce the concept of design continuums for the data layout of key-value stores. A design continuum unifies major distinct data structure designs under the same model. The critical insight and potential long-term impact is that such unifying models 1) render what we consider up to now as fundamentally different data structures to be seen as views of the very same overall design space, and 2) allow seeing new data structure designs with performance properties that are not feasible by… CONTINUE READING


    Publications referenced by this paper.
    Bigtable: A Distributed Storage System for Structured Data
    • 4,691
    • PDF
    Cassandra: a decentralized structured storage system
    • 2,419
    • PDF
    Organization and maintenance of large ordered indexes
    • 939
    • PDF
    Design Tradeoffs for SSD Performance
    • 987
    • PDF
    Generalized Search Trees for Database Systems
    • 577
    • PDF
    The log-structured merge-tree (LSM-tree)
    • 685
    • PDF
    The Case for Learned Index Structures
    • 287
    • PDF
    Organization and maintenance of large ordered indices
    • 512
    • PDF
    MICA: A Holistic Approach to Fast In-Memory Key-Value Storage
    • 347
    • PDF
    Patterns for parallel programming
    • 718
    • PDF