The automatic elimination of duplicate data in a storage system, commonly known as
deduplication, is increasingly accepted as an effective technique to reduce storage costs …

Persistent key-value stores are widely used as building blocks in today's IT infrastructure for
managing and storing large amounts of data. However, studies of characterizing real-world …

When network is undergoing problems such as congestion, scan attack, DDoS attack, etc.,
measurements are much more important than usual. In this case, traffic characteristics …

We present NetCache, a new key-value store architecture that leverages the power and
flexibility of new-generation programmable switches to handle queries on hot items and …

In many networking systems, Bloom filters are used for high-speed set membership tests.
They permit a small fraction of false positive answers with very good space efficiency …

We present WiscKey, a persistent LSM-tree-based key-value store with a performance-
oriented data layout that separates keys from values to minimize I/O amplification. The …

Key-value stores such as LevelDB and RocksDB offer excellent write throughput, but suffer
high write amplification. The write amplification problem is due to the Log-Structured Merge …

An argument that the material arrangements of information—how it is represented and
interpreted—matter significantly for our experience of information and information systems …

Growing main memory capacity has fueled the development of in-memory big data
management and processing. By eliminating disk I/O bottleneck, it is now possible to support …

This paper describes the design and implementation of HERD, a key-value system designed
to make the best use of an RDMA network. Unlike prior RDMA-based key-value systems …