@inproceedings{f0d338b1641c4ea7895411386bc0bf44,
title = "On Lowering Merge Costs of an LSM Tree",
keywords = "column-oriented, Min-Max, write-optimized",
author = "\{Ton That\}, \{Dai Hai\} and Mohammadsaleh Gharehdaghi and Alexander Rasin and Tanu Malik",
note = "Publisher Copyright: {\textcopyright} 2021 ACM.; 33rd International Conference on Scientific and Statistical Database Management, SSDBM 2021 ; Conference date: 06-07-2021 Through 07-07-2021",
year = "2021",
month = aug,
day = "11",
doi = "10.1145/3468791.3468820",
language = "English",
series = "ACM International Conference Proceeding Series",
publisher = "Association for Computing Machinery",
pages = "253--258",
editor = "Qiang Zhu and Xingquan Zhu and Yicheng Tu and Zichen Xu and Anand Kumar",
booktitle = "33rd International Conference on Scientific and Statistical Database Management, SSDBM 2021, Proceedings",
}