Skip to main content

Advertisement

Springer Nature Link
Log in

L2SM: a query-optimized linked LSM-tree for HTAP workloads

  • Letter
  • Published:
Frontiers of Computer Science Aims and scope Submit manuscript

Conclusion

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Duan H, Hu H, Qian W, Zhou A. Incremental join view maintenance on distributed log-structured storage. Frontiers of Computer Science, 2021, 15(4): 154607

    Article  Google Scholar 

  2. Long L, He S, Shen J, Liu R, Tan Z, Gao C, Liu D, Zhong K, Jiang Y. WA-zone: wear-aware zone management optimization for LSM-tree on ZNS SSDs. ACM Transactions on Architecture and Code Optimization, 2024, 21(1): 16

    Article  Google Scholar 

  3. Saxena H, Golab L, Idreos S, Ilyas I F. Real-time LSM-trees for HTAP workloads. In: Proceedings of the 39th International Conference on Data Engineering (ICDE). 2023, 1208–1220

    Google Scholar 

  4. Zhong W, Chen C, Wu X, Jiang S. REMIX: efficient range query for LSM-trees. In: Proceedings of the 19th USENIX Conference on File and Storage Technologies. 2021, 51–64

    Google Scholar 

  5. Yao T, Wan J, Huang P, He X, Wu F, Xie C. Building efficient key-value stores via a lightweight compaction tree. ACM Transactions on Storage (TOS), 2017, 13(4): 29

    Google Scholar 

Download references

Acknowledgements

This paper was supported by the Fundamental Research Funds for the National Natural Science Foundation of China under Grant No.62472077.

Author information

Authors and Affiliations

  1. Software College, Northeastern University, Shenyang, 110819, China

    Xiaoyue Feng, Dashan Wei, Chaopeng Guo & Jie Song

Authors
  1. Xiaoyue Feng
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Dashan Wei
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Chaopeng Guo
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Jie Song
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Jie Song.

Ethics declarations

Competing interests The authors declare that they have no competing interests or financial conflicts to disclose.

Additional information

Electronic supplementary material Supplementary material is available in the online version of this article at journal.hep.com.cn and link.springer.com.

Electronic supplementary material

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Feng, X., Wei, D., Guo, C. et al. L2SM: a query-optimized linked LSM-tree for HTAP workloads. Front. Comput. Sci. 19, 197606 (2025). https://doi.org/10.1007/s11704-024-40553-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11704-024-40553-0