Compaction Management in Distributed Key-Value Datastores

@article{Ahmad2015CompactionMI,
  title={Compaction Management in Distributed Key-Value Datastores},
  author={Muhammad Yousuf Ahmad and Bettina Kemme},
  journal={PVLDB},
  year={2015},
  volume={8},
  pages={850-861}
}
Compactions are a vital maintenance mechanism used by datastores based on the log-structured merge-tree to counter the continuous buildup of data files under update-intensive workloads. While compactions help keep read latencies in check over the long run, this comes at the cost of significantly degraded read performance over the course of the compaction itself. In this paper, we offer an in-depth analysis of compaction-related performance overheads and propose techniques for their mitigation… CONTINUE READING
Highly Cited
This paper has 24 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 17 extracted citations

LSbM-tree: Re-Enabling Buffer Caching in Data Management for Mixed Reads and Writes

2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) • 2017
View 5 Excerpts
Highly Influenced

Re-enabling high-speed caching for LSM-trees

ArXiv • 2016
View 3 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Mesa: Geo-replicated, near real-time, scalable data warehousing

A. Gupta, F. Yang, +16 authors D. Agrawal
PVLDB, 7(12):1259–1270, • 2014

Similar Papers

Loading similar papers…