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

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.

💡 Research Summary

The paper presents a four‑stage transaction management framework designed for document‑oriented NoSQL databases, using MongoDB as the reference platform. The authors identify the tension between the scalability and eventual‑consistency guarantees that typify NoSQL systems and the strong ACID guarantees required by many modern applications such as finance, inventory, and healthcare. To bridge this gap without modifying the underlying database engine, they introduce a middleware layer that intercepts transaction requests and processes them through four distinct stages: (1) Transaction lifecycle management, which creates an execution context and assigns a unique identifier; (2) Operation classification, which categorizes each operation (read‑only, write‑only, read‑modify‑write) and determines the document‑level key set; (3) Readiness assessment, which performs pre‑execution conflict detection by sorting the key set and checking for overlapping intervals, achieving O(n log n) complexity where n is the number of operations; and (4) Transaction execution, which employs an adaptive lock manager that grants document‑level locks, enforces a 100 ms timeout, and applies exponential back‑off (initial 10 ms, maximum 500 ms) to prevent deadlocks.

Formal correctness analysis proves that the combination of ordered lock acquisition, timeout‑based abort, and pre‑execution validation guarantees conflict‑serializability under the defined model. The authors also provide a complexity analysis showing that the additional overhead introduced by conflict detection is bounded and does not dominate overall transaction latency.

Experimental evaluation uses the Yahoo Cloud Serving Benchmark (YCSB) with workloads A (50 % reads, 50 % writes), B (95 % reads), and F (read‑modify‑write) across concurrency levels from 1 to 100 clients. On a single‑node MongoDB deployment, the framework reduces transaction abort rates from 8.3 % to 4.7 % (a 43 % reduction), eliminates observed deadlocks, and cuts latency variance by 34.2 %. Throughput improvements range from 6.3 % to 18.4 % under high concurrency, with the most pronounced gains on workload F. Distributed experiments on clusters of up to nine nodes demonstrate scalability: throughput increases by 15.2 % and abort rates drop by 53 % compared to the baseline.

The authors benchmark against MongoDB’s native multi‑document transactions, CockroachDB, and TiDB. Their framework achieves a comparable level of consistency (snapshot isolation with serializable guarantees) while incurring less than 10 % average latency overhead and delivering higher throughput, especially for update‑heavy workloads. Sensitivity analysis identifies optimal parameter settings: a lock timeout of 100 ms, an initial back‑off of 10 ms, and a maximum back‑off of 500 ms.

In the discussion, the paper highlights that pre‑execution conflict detection eliminates roughly 78 % of conflicts that would otherwise cause aborts during execution, and that timeout‑based deadlock prevention guarantees forward progress without the need for complex detection/recovery mechanisms. Limitations include potential lock contention for transactions spanning many collections and the need to tune timeout/back‑off parameters for different workload characteristics. Future work is proposed on extending the framework to multi‑data‑center deployments, integrating multi‑version concurrency control, and employing machine‑learning techniques for dynamic parameter adaptation.

Overall, the study delivers a practical, middleware‑based solution that brings strong ACID guarantees to document‑oriented NoSQL databases while preserving their hallmark scalability, offering a compelling option for applications that demand both high performance and strict data integrity.