Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Log-structured merge-tree

Known as: LSM, LSM-tree, Log-structured merge tree 
In computer science, the log-structured merge-tree (or LSM tree) is a data structure with performance characteristics that make it attractive for… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
As widely used indices in key-value stores, the Log-Structured Merge-tree (LSM-tree) and its variants suffer from severe write… Expand
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
2019
2019
Data-intensive key-value stores based on the Log-Structured Merge-Tree are used in numerous modern applications ranging from… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2018
2018
In this article, we show that key-value stores backed by a log-structured merge-tree (LSM-tree) exhibit an intrinsic tradeoff… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2018
2018
Log-structured Merge Tree (LSM) [17] is a data structure that is widely used in write-intensive storage system. However, it… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 3
Is this relevant?
2018
2018
In this paper, we show that all mainstream LSM-tree based key-value stores in the literature and in industry are suboptimal with… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2018
2018
Modern database systems are in need of supporting highly scalable transactions of data updates and efficient queries over data… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2018
2018
Log-structured merge tree has been adopted by many distributed storage systems. It decomposes a large database into multiple… Expand
  • figure 1
  • figure 2
  • table 2
  • table 1
  • figure 3
Is this relevant?
2018
2018
Modern persistent key-value stores typically use a log-structured merge-tree (LSM-tree) design, which allows for high write… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2009
Highly Cited
2009
High-performance transaction system applications typically insert rows in a History table to provide an activity trace; at the… Expand
  • figure 2.1
  • figure 2.2
  • figure 3.1
  • figure 3.1
  • figure 6.1
Is this relevant?
2008
2008
Rose is a database storage engine for high-throughput replication. It targets seek-limited, write-intensive transaction… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 3
Is this relevant?