Optimal Bloom Filters and Adaptive Merging for LSM-Trees

Dayan, N; Athanassoulis, M; Idreos, S

Dayan, N (reprint author), Harvard Univ, Cambridge, MA 02138 USA.

ACM TRANSACTIONS ON DATABASE SYSTEMS, 2018; 43 (4):

Abstract

In this article, we show that key-value stores backed by a log-structured merge-tree (LSM-tree) exhibit an intrinsic tradeoff between lookup cost, upd......

Full Text Link