L2SM: a query-optimized linked LSM-tree for HTAP workloads
摘要
This paper proposes a novel dual-pointer structure with a root node (called L2SM) and designs three optimization algorithms to improve the performance of L2SM. These improvements greatly enhance point and range query performance and reduce memory overhead without significant write performance loss.