The LSM design space and its read optimizations
Log-structured merge (LSM) trees have emerged as one of the most commonly used storage-
based data structures in modern data systems as they offer high throughput for writes and …
based data structures in modern data systems as they offer high throughput for writes and …
Dissecting, designing, and optimizing LSM-based data stores
S Sarkar, M Athanassoulis - … of the 2022 International Conference on …, 2022 - dl.acm.org
Log-structured merge (LSM) trees have emerged as one of the most commonly used disk-
based data structures in modern data systems. LSM-trees employ out-of-place ingestion to …
based data structures in modern data systems. LSM-trees employ out-of-place ingestion to …
On performance stability in LSM-based storage systems (extended version)
The Log-Structured Merge-Tree (LSM-tree) has been widely adopted for use in modern
NoSQL systems for its superior write performance. Despite the popularity of LSM-trees, they …
NoSQL systems for its superior write performance. Despite the popularity of LSM-trees, they …
KVS tree
D Boles, JM Groves, S Moyer, A Tomlinson - US Patent 10,725,988, 2020 - Google Patents
A KVS tree and operations thereon are described herein. A key-value set (kvset) is received
to store in a key-value data structure on at least one machine readable medium. The kvset …
to store in a key-value data structure on at least one machine readable medium. The kvset …
Efficient data ingestion and query processing for LSM-based storage systems
In recent years, the Log Structured Merge (LSM) tree has been widely adopted by NoSQL
and NewSQL systems for its superior write performance. Despite its popularity, however …
and NewSQL systems for its superior write performance. Despite its popularity, however …
Revisiting Secondary Indexing in {LSM-based} Storage Systems with Persistent Memory
LSM-based storage systems are widely used for superior write performance on block
devices. However, they currently fail to efficiently support secondary indexing, since a …
devices. However, they currently fail to efficiently support secondary indexing, since a …
Perseid: A Secondary Indexing Mechanism for LSM-Based Storage Systems
LSM-based storage systems are widely used for superior write performance on block
devices. However, they currently fail to efficiently support secondary indexing, since a …
devices. However, they currently fail to efficiently support secondary indexing, since a …
Merge tree garbage metrics
D Boles, JM Groves, S Moyer, A Tomlinson - US Patent 10,706,105, 2020 - Google Patents
Abstract Systems and techniques for collecting and using merge tree garbage metrics are
described herein. A kvset is created for a node in a KVS tree. Here, a set of kvset metrics for …
described herein. A kvset is created for a node in a KVS tree. Here, a set of kvset metrics for …
[PDF][PDF] Indexing in an Actor-Oriented Database.
Many of today's interactive server applications are implemented using actor-oriented
programming frameworks. Such applications treat actors as a distributed in-memory object …
programming frameworks. Such applications treat actors as a distributed in-memory object …