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)
Performance models of timestamp-ordering concurrency control algorithms in distributed databases
IEEE Transactions on Computers
The datacycle architecture for very high throughput database systems
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Performance Analysis of Static Locking in Distributed Database Systems
IEEE Transactions on Computers
Principles of distributed database systems
Principles of distributed database systems
Approximate analysis of reader and writer access to a shared resource
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Communications of the ACM - Special issue on information filtering
Computer Networks and ISDN Systems - Special issue on high speed networks
Protocols for high-speed networks: some questions and a few answers
Computer Networks and ISDN Systems - Special issue on protocol specification, testing and verification
Analysis of locking policies in database management systems
Communications of the ACM
Proceedings of the 2nd International Workshop on High Performance Transaction Systems
A scale database architecture for network services
IEEE Communications Magazine
The latency/bandwidth tradeoff in gigabit networks
IEEE Communications Magazine
Distributed database systems in high-speed wide-area networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.24 |
In this paper, we consider an application of high-speed wide area networks, viz. that of distributed database systems (DDBS). In a high-speed environment, although the transmission delay decreases, the propagation delay (communication latency) now becomes the throughput thwarting factor. Existing Concurrency Control (CC) protocols do not address the communication latency problem. This paper is a continuation of our research work in this area. First, we very briefly summarize our previously reported research results, viz. the issues that are important for DDBS in high-speed wide area networks, and the description of a new CC protocol called 'send-on-demand'. A detailed comparison of this protocol with that of locking is provided, using analytical and simulation techniques. The datacycle scheme performs very well in a read-oriented environment, and the rest of the paper deals with developing and comparing hybrid CC schemes using datacycling for queries. Altogether, the performance of four concurrency control schemes is compared.