Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Concurrency control performance modeling: alternatives and implications
ACM Transactions on Database Systems (TODS)
Parallelism and concurrency control performance in distributed database machines
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Principles of distributed database systems
Principles of distributed database systems
Concurrency control in advanced database applications
ACM Computing Surveys (CSUR)
Concurrency control for high contention environments
ACM Transactions on Database Systems (TODS)
Fine-grained sharing in a page server OODBMS
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Caching and memory management in client-server database systems
Caching and memory management in client-server database systems
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
Performance Limits of Two-Phase Locking
Proceedings of the Seventh International Conference on Data Engineering
A Transaction Processing Model for the Mobile Data Access System
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Comparison of Database Replication Techniques Based on Total Order Broadcast
IEEE Transactions on Knowledge and Data Engineering
On performance evaluation and design of atomic commit protocols for mobile transactions
Distributed and Parallel Databases
Performance evaluation of Atomic Commit Protocols for mobile transactions
International Journal of Intelligent Information and Database Systems
Hi-index | 0.00 |
Simulating distributed database systems is inherently difficult, as there are many factors that may influence the results. This includes architectural options as well as workload and data distribution. In this paper we present the DBsim simulator and some simulation results. The DBsim simulator architecture is extendible, and it is easy to change parameters and configuration. The simulation results in this paper is a comparison of performance and response times for two concurrency control algorithms, timestamp ordering and two-phase locking. The simulations have been run with different number of nodes, network types, data declustering and workloads. The results show that for a mix of small and long transactions, the throughput is significantly higher for a system with a timestamp ordering scheduler than for a system with a two-phase locking scheduler. With only short transactions, the performance of the two schedulers are almost identical. Long transactions are treated more fair by a two-phase locking scheduler, because a timestamp ordering scheduler has a very high abort rate for long transactions.