Probabilistic Models of Database Locking: Solutions, Computational Algorithms, and Asymptotics
Journal of the ACM (JACM)
A mean value performance model for locking in databases: the no-waiting case
Journal of the ACM (JACM)
An introduction to database systems: vol. I (4th ed.)
An introduction to database systems: vol. I (4th ed.)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
A decomposition approach to a model of a transaction processing system
A decomposition approach to a model of a transaction processing system
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Analysis of locking policies in database management systems
Communications of the ACM
Altruistic Locking: A Strategy for Coping with Long Lived Transactions
Proceedings of the 2nd International Workshop on High Performance Transaction Systems
Split-Transactions for Open-Ended Activities
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
A decomposition solution to the queueing network model of the centralized DBMS with static locking
SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Performance Modeling of Distributed and Replicated Databases
IEEE Transactions on Knowledge and Data Engineering
Increasing the Expressiveness of Analytical Performance Models for Replicated Databases
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Performance analysis of long-lived cooperative transactions in active DBMS
Data & Knowledge Engineering
A transactional grid workflow service for ShanghaiGrid
International Journal of Web and Grid Services
Performance modelling of asynchronous replica distribution technique on distributed database systems
International Journal of Computer Mathematics - Distributed Algorithms in Science and Engineering
A pipeline-based approach for long transaction processing in web service environments
International Journal of Web and Grid Services
Hi-index | 0.01 |
Increasing the parallelism in transaction processing and maintaining data consistency appear to be two conflicting goals in designing Distributed Database Systems (DDBS). This problem becomes especially difficult if the DDBS is serving long-lived transactions (LLTs). Recently, a special case of LLTs, called sagas, has been introduced that addresses this problem. The DDBS with sagas provides high parallelism to transactions by allowing sagas to release their locks as early as possible. However, it is also subject to overhead due to efforts needed to restore data consistency in case of failures. In this paper, we first conduct a series of simulation studies to compare the performance of LLT systems with saga implementation (or saga systems) and the LLT systems without saga implementation (or nonsaga systems) in a faulty environment. The simulation studies show that the saga systems outperform their nonsaga counterparts under most of conditions including the heavy failure cases. We thus propose an analytical queuing model to further investigate the performance behavior of the saga systems. The motivation of the development of this analytical model is twofold. It assists us to further study quantitatively the performance penalty of the saga implementation due to the failure recovery overhead. Furthermore, the analytical solution can be used by system administrators to fine tune the performance of the saga system. This analytical model captures the primary aspects of the saga system, namely, data locking, resource contention, and failure recovery. Due to the complicated nature of the analytical modeling, we solve the model approximately for various performance metrics using decomposition methods, and validate the accuracy of the analytical results via simulations.