Optimal Bloom Filters and Adaptive Merging for LSM-Trees

@article{Dayan2018OptimalBF,
  title={Optimal Bloom Filters and Adaptive Merging for LSM-Trees},
  author={Niv Dayan and Manos Athanassoulis and Stratos Idreos},
  journal={ACM Trans. Database Syst.},
  year={2018},
  volume={43},
  pages={16:1-16:48}
}
In this article, we show that key-value stores backed by a log-structured merge-tree (LSM-tree) exhibit an intrinsic tradeoff between lookup cost, update cost, and main memory footprint, yet all existing designs expose a suboptimal and difficult to tune tradeoff among these metrics. We pinpoint the problem to the fact that modern key-value stores suboptimally co-tune the merge policy, the buffer size, and the Bloom filters’ false-positive rates across the LSM-tree’s different levels. We… CONTINUE READING
1
Twitter Mention

Citations

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

LSM-based storage techniques: a survey

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

The Log-Structured Merge-Bush & the Wacky Continuum

  • SIGMOD Conference
  • 2019
VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS

References

Publications referenced by this paper.
SHOWING 1-5 OF 5 REFERENCES

Retrieved from http://cassandra.apache.org

Apache. Cassandra
  • ACM Transactions on Database Systems,
  • 2018
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

bLSM: a general purpose log structured merge tree

  • SIGMOD Conference
  • 2012
VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL

Cassandra: a decentralized structured storage system

  • Operating Systems Review
  • 2010
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL