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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1996-2017
05101519962017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Log-structured merge tree decomposes a large database into multiple parts: an in-writing part and several read-only ones. It… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 6
Is this relevant?
2017
2017
The proliferation of GPS-enabled mobile devices has generated geo-tagged data at an unprecedented rate over the past decade. Data… (More)
  • figure 1
  • table II
  • figure 2
  • table III
Is this relevant?
2017
2017
Recent years, the log-structured merge-tree(LSM-tree) style storage has been widely adopted in distributed data storage systems(e… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2017
2017
Multi-component based Log-Structured Merge-tree (LSM-tree) has been becoming one of the mainstream indexes. LSM-tree adopts… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2016
2016
The paper is devoted to an analytical prediction of the force production capability of a quasi-Halbach PM excited tubular-linear… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?
2014
2014
Various key-value (KV) stores are widely employed for data management to support Internet services as they offer higher… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 2
Is this relevant?
2014
2014
In this paper we describe the design and implementation of ACaZoo, a key-value store that combines strong consistency with high… (More)
  • figure 3
  • figure 1
  • figure 4
  • figure 2
  • figure 5
Is this relevant?
2008
2008
Rose is a database storage engine for high-throughput replication. It targets seek-limited, write-intensive transaction… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
1996
1996
High-performance transaction system applications typically insert rows in a History table to provide an activity trace; at the… (More)
  • figure 2.1
  • figure 2.2
  • figure 3.1
  • figure 3.1
  • figure 6.1
Is this relevant?
Highly Cited
1996
Highly Cited
1996
High-performance transaction system applications typically insert rows in a History table to provide an activity trace; at the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?