A Scalable Transaction Management Framework for Consistent Document-Oriented NoSQL Databases

📅 2026-01-23
📈 Citations: 0
✨ Influential: 0
📄 PDF
🤖 AI Summary
Document-oriented NoSQL databases, which typically adopt eventual consistency models, struggle to support highly reliable transaction processing. This work proposes a four-phase transaction management framework that achieves conflict-serializable consistency while preserving system scalability. By integrating transaction lifecycle management, operation classification, pre-execution conflict detection, and an adaptive locking strategy, the approach effectively eliminates deadlocks and significantly reduces both transaction abort rates and latency variance. Experimental results demonstrate that the abort rate decreases from 8.3% to 4.7%, and latency variance is reduced by 34.2%. Under high concurrency, throughput improves by 6.3%–18.4%, with a 15.2% increase observed in a 9-node cluster, accompanied by a 53% reduction in abort rate.

Technology Category

Data Mining & Knowledge Management: Scalability, Parallel & Distributed SystemsSearch and Optimization: Distributed SearchMachine Learning: Scalability of ML Systems

Application Category

Systems and Infrastructure for Web, Mobile and WoT: Data management and stream processing for Web, mobile and wireless applicationsGraph Algorithms and Modeling for the Web: Efficient manipulation of static and dynamic Web-related graphsSecurity and Privacy: Data transparency and provenance
📝 Abstract
NoSQL databases are widely used in modern applications due to their scalability and schema flexibility, yet they often rely on eventual consistency models that limit reliable transaction processing. This study proposes a four-stage transaction management framework for document-oriented NoSQL databases, with MongoDB as the reference platform. The framework combines transaction lifecycle management, operation classification, pre-execution conflict detection, and an adaptive locking strategy with timeout-based deadlock prevention. Formal correctness analysis shows that the proposed approach guarantees conflict serializability under defined conditions. An experimental evaluation using the Yahoo Cloud Serving Benchmark (YCSB) workloads A, B, and F, with concurrency levels ranging from 1 to 100 clients, demonstrates a reduction in transaction abort rates from 8.3% to 4.7%, the elimination of observed deadlocks, and a 34.2% decrease in latency variance. Throughput improvements ranging from 6.3% to 18.4% are observed under high concurrency, particularly for read-modify-write workloads. Distributed experiments on clusters of up to 9 nodes confirm scalability, achieving 15.2% higher throughput and 53% lower abort rates than baseline systems. Comparisons with MongoDB's native transactions, CockroachDB, and TiDB indicate that the proposed framework strikes a good balance between consistency guarantees and performance overhead. Sensitivity analysis identifies optimal parameter settings, including a lock timeout of 100 ms, an initial backoff of 10 ms, and a maximum backoff of 500 ms. These results show that carefully designed consistency mechanisms can significantly improve data integrity in NoSQL systems without undermining scalability.
Problem

Research questions and friction points this paper is trying to address.

NoSQL
transaction management
consistency
document-oriented database
scalability
Innovation

Methods, ideas, or system contributions that make the work stand out.

transaction management
conflict serializability
adaptive locking
deadlock prevention
NoSQL scalability
A
Adam A. E. Alflahi
Department of Computer Science and Mathematics, Bahri University, Khartoum, Sudan
M
Mohammed A. Y. Mohammed
Department of Mathematics and Statistics, Georgia State University, Atlanta, GA, USA
A
Abdallah Alsammani
Division of Physics, Engineering, Mathematics, and Computer Science, Delaware State University, Dover, DE, USA