dCompaction: Speeding up Compaction of the LSM-Tree via Delayed Compaction

@article{Pan2017dCompactionSU,
  title={dCompaction: Speeding up Compaction of the LSM-Tree via Delayed Compaction},
  author={Fengfeng Pan and Yinliang Yue and Jin Xiong},
  journal={Journal of Computer Science and Technology},
  year={2017},
  volume={32},
  pages={41-54}
}
Key-value (KV) stores have become a backbone of large-scale applications in today’s data centers. Writeoptimized data structures like the Log-Structured Merge-tree (LSM-tree) and their variants are widely used in KV storage systems like BigTable and RocksDB. Conventional LSM-tree organizes KV items into multiple, successively larger components, and uses compaction to push KV items from one smaller component to another adjacent larger component until the KV items reach the largest component… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-3 OF 3 CITATIONS

Efficient Key-Value Stores with Ranged Log-Structured Merge Trees

  • 2018 IEEE 11th International Conference on Cloud Computing (CLOUD)
  • 2018
VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

LSM-based storage techniques: a survey

  • The VLDB Journal
  • 2018
VIEW 6 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-10 OF 20 REFERENCES

Similar Papers