Modernizing Write-Heavy Scenarios in Distributed Systems: LSM Trees and Scylla DB

Main Article Content

Bandi. Aruna
P. Swapna
G. Vinutha
Ch. Mary Pushpa

Abstract

As modern applications become increasingly dataintensive, there is a growing demand for database systems that can efficiently manage high write-throughput workloads without compromising on performance or scalability. This research examines the internal mechanisms of ScyllaDB, a highperformance NoSQL database that utilises Log-Structured Merge (LSM) trees to address the challenges of write-intensive environments. ScyllaDB optimises data ingestion and persistence by utilising in-memory MemTables, commit logs for durability, and immutable SSTables for disk storage, which are periodically merged through compaction processes to enhance read efficiency and reduce disk usage. The study examines the architectural components of ScyllaDB, focusing on the roles of SS Tables and compaction strategies—Size-Tiered, Levelled, and Time-Window Compaction—in managing storage and retrieval. Experimental deployment within an educational institutional setting demonstrates ScyllaDB’s ability to maintain low-latency writes and scalable data distribution across multiple nodes, highlighting the effectiveness of schema design, partitioning, and resource management. Furthermore, the paper introduces a novel cluster auto-tuning algorithm for ScyllaDB that dynamically adjusts system parameters (e.g., memory allocation, compaction rate, and thread pools) based on real-time performance metrics. A mathematical model is proposed to optimise system latency and throughput under workload variations, utilising reinforcement learning-inspired logic and resource-constrained optimisation. The findings validate ScyllaDB’s effectiveness in high-volume scenarios such as real-time analytics, IoT data management, and time-series databases, positioning it as a robust alternative to traditional relational systems and legacy NoSQL platforms. The proposed auto-tuning framework holds promise for future selfadaptive database clusters in dynamic environments. This research provides practical insights into deploying and optimising write-intensive database systems for modern distributed computing needs.

Downloads

Download data is not yet available.

Article Details

Section

Articles

How to Cite

[1]
Bandi. Aruna, P. Swapna, G. Vinutha, and Ch. Mary Pushpa , Trans., “Modernizing Write-Heavy Scenarios in Distributed Systems: LSM Trees and Scylla DB”, IJITEE, vol. 14, no. 9, pp. 26–31, Aug. 2025, doi: 10.35940/ijitee.I1130.14090825.
Share |

References

Feng, L., Liu, L., Zhang, Z., & Xu, M. (2022). A survey of compaction management in LSM-tree-based key-value stores. Frontiers of Computer Science, 16(2), 1–23. DOI: https://doi.org/10.1007/s11704-021-0436-2

Chitransh, A., & Kalyan, B. S. (2021). ARM Microcontroller-Based Wireless Industrial Automation System. *Indian Journal of Microprocessors and Microcontroller*, 1(2), 8–11. DOI: https://doi.org/10.54105/ijmm.b1705.091221

Lakshman, A., & Malik, P. (2017). Cassandra: A decentralized structured storage system. *ACM SIGOPS Operating Systems Review*, 44(2), 35–40. DOI: http://dx.doi.org/10.1145/1773912.1773922

Wang, Y., Hu, Z., & Yang, X. (2023). ElasticLSM: An elastic and adaptive compaction scheme for LSM-tree-based storage systems. Future Generation Computer Systems, 139, 135–148. DOI: https://doi.org/10.1016/j.future.2023.01.012

Park, J., Lee, M., & Kim, J. (2022). Write Optimization in Time-Series Databases Using Enhanced LSM Trees. ACM Transactions on Storage (TOS), 18(1), Article 3. DOI: https://doi.org/10.1145/3491027