Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
To appear in Proceedings of the 23rd ACM Symposium on Operating Systems Principles (SOSP'11) This version is reformatted from the official version that appears in the conference proceedings.
 

Summary: To appear in Proceedings of the 23rd ACM Symposium on Operating Systems Principles (SOSP'11)
This version is reformatted from the official version that appears in the conference proceedings.
SILT: A Memory-Efficient, High-Performance Key-Value Store
Hyeontaek Lim1, Bin Fan1, David G. Andersen1, Michael Kaminsky2
1Carnegie Mellon University, 2Intel Labs
ABSTRACT
SILT (Small Index Large Table) is a memory-efficient, high-
performance key-value store system based on flash storage that
scales to serve billions of key-value items on a single node. It re-
quires only 0.7 bytes of DRAM per entry and retrieves key/value
pairs using on average 1.01 flash reads each. SILT combines new
algorithmic and systems techniques to balance the use of memory,
storage, and computation. Our contributions include: (1) the design
of three basic key-value stores each with a different emphasis on
memory-efficiency and write-friendliness; (2) synthesis of the basic
key-value stores to build a SILT key-value store system; and (3) an
analytical model for tuning system parameters carefully to meet the
needs of different workloads. SILT requires one to two orders of
magnitude less memory to provide comparable throughput to cur-
rent high-performance key-value systems on a commodity desktop

  

Source: Andersen, Dave - School of Computer Science, Carnegie Mellon University
Carnegie Mellon University, School of Computer Science, Informedia Project

 

Collections: Computer Technologies and Information Sciences