作者: Mainak Ghosh , Indranil Gupta , Shalmoli Gupta , Nirman Kumar
关键词:
摘要: Compaction plays a crucial role in NoSQL systems to ensure high overall read throughput. In this work, we formally define compaction as an optimization problem that attempts minimize disk I/O. We prove be NPHard. then propose set of algorithms and mathematically analyze upper bounds on worst-case cost. evaluate the proposed real-life workloads. Our results show our incur low I/O costs approach using balanced tree is most preferable.