Distributed databases are fundamental infrastructures of today's large-scale software
systems such as cloud systems. Detecting anomalies in distributed databases is essential …

Filter data structures have been used ubiquitously since the 1970s to answer approximate
set-membership queries in various areas of computer science including architecture …

Log-structured merge trees (LSM trees) are increasingly used as part of the storage engine
behind several data systems, and are frequently deployed in the cloud. As the number of …

Key-value data structures constitute the core of any datadriven system. They provide the
means to store, search, and modify data residing at various levels of the storage and …

Data-intensive applications have fueled the evolution of log-structured merge (LSM) based
key-value engines that employ the out-of-place paradigm to support high ingestion rates …

Filter data structures are widely used in various areas of computer science to answer
approximate set-membership queries. In many applications, the data grows dynamically …

Persistent key-value (KV) stores are widely used by cloud services at ByteDance as local
storage engines, and RocksDB used to be the de facto implementation since it can be …

We use machine learning to optimize LSM-tree structure, aiming to reduce the cost of
processing various read/write operations. We introduce a new approach CAMAL, which …

The log-structured merge tree (LSM-tree) is widely employed to build key-value (KV) stores.
LSM-tree organizes multiple levels in memory and on disk. The compaction of LSM-tree …

Key-value stores are at the core of several modern NoSQL-based data systems, and thus, a
comprehensive benchmark tool is of paramount importance in evaluating their performance …