1 |
O'Neil P, Cheng E, Gawlick D, et al. The log-structured merge-tree (LSM-tree)[J]. Acta Informatica, 1996, 33(4): 351-385.
|
2 |
Dayan N, Idreos S. The log-structured merge-bush & the wacky continuum[A]. Proceedings of the 2019 International Conference on Management of Data[C]. New York, USA: ACM, 2019. 449-466.
|
3 |
Luo C, Carey M J. LSM-based storage techniques: a survey[J]. The VLDB Journal, 2020, 29(1): 393-418.
|
4 |
Bloom B H. Space/time trade-offs in Hash coding with allowable errors[J]. Communications of the ACM, 1970, 13(7): 422-426.
|
5 |
Chang F, Dean J, Ghemawat S, et al. Bigtable: a distributed storage system for structured data[J]. ACM Transactions on Computer Systems (TOCS), 2008, 26(2): 1-26.
|
6 |
Dayan N, Athanassoulis M, Idreos S. Monkey: optimal navigable key-value store[A]. Proceedings of the 2017 ACM International Conference on Management of Data[C]. New York, USA: ACM, 2017. 79-94.
|
7 |
Dayan N, Athanassoulis M, Idreos S. Optimal bloom filters and adaptive merging for LSM-trees[J]. ACM Transactions on Database Systems (TODS), 2018, 43(4): 1-48.
|
8 |
Li Y, Tian C, Guo F, et al. ElasticBF: elastic bloom filter with hotness awareness for boosting read performance in large key-value stores[A]. Proceedings of the 2019 USENIX Annual Technical Conference[C]. Berkeley, USA: USENIX Association, 2019. 739-752.
|
9 |
Wu X, Xu Y, Shao Z, et al. LSM-trie: an LSM-tree-based ultra-large key-value store for small data items[A]. Proceedings of the 2015 USENIX Annual Technical Conference[C]. Berkeley, USA: USENIX Association, 2015. 71-82.
|
10 |
Cooper B F, Silberstein A, Tam E, et al. Benchmarking cloud serving systems with YCSB[A]. Proceedings of the 1st ACM Symposium on Cloud Computing[C]. New York, USA: ACM, 2010. 143-154.
|
11 |
Bronson N, Amsden Z, Cabrera G, et al. TAO: Facebook's distributed data store for the social graph[A]. Proceedings of the 2013 USENIX Annual Technical Conference[C]. Berkeley, USA: USENIX Association, 2013. 49-60.
|