Abstract
Even though most commercial database management systems use pessimistic concurrency control in transaction processing systems, these approaches may restrict system throughput levels inconsistent with the available processing capacity. This paper suggests an efficient hybrid concurrency control scheme that uses a deadlock-free approach and ensures that transactions are re-started at most once. By the simulation-based analysis, we show that the proposed protocol outperforms than static hybrid protocol across all range of system and workload settings.
This Work is Supported by Hanshin University Research Grants in 2003.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Gray, P. Holland, P. O’Neil, and D. Shasha, “The Dangers of Replicaton and a Solution,” Proceedings of ACM SIGMOD International Conference on Management of Data, 1996.
P. S. Yu, H. Heiss, and D. M. Dias, “Modeling and Analysis of a Time-Stamp History Based Certification Protocol for Concurrency Control”, IEEE Trans. Know. and Data Eng., vol. 3. no. 4, pp. 525–537, Dec. 1991.
M. J. Franklin and M. J. Carey, “Client-Server Caching Revisited,” Proceedings of the International Workshop on Distributed Object Management, August, 1992
M. Carey, M. Franklin, and M. Zaharioudakis, “Fine-Graned Sharing in a Page Server OODBMS,” Proceedings of ACM SIGMOD Conference on Management of Data, pp. 359–370, 1994.
M. Franklin, “Caching and Memory Management in Client-Server Database systems,” Thechnical Report(Ph.D.) 1168, Computer Sciences Department, University of Wisconsin-Madison, 1993.
G.K. Zipf, Human Behavior and the Principles of Least Effort, Reading, Mass., Addison Wesley, 1949.
V. Almeida, A. Bestavros, M. Crovella, and A. D. Oliveira. “Characterizing reference locality in the WWW,” Proceedings of the 1996 International Conference on Parallel and Distributed Information Systems (PDIS’ 96), pp. 92–103, 1996.
S. Acharya, and S. Muthukrishman. “Scheduling On-demand Broadcasts: New Metrics and Algorithms,” Proceedings of MOBICOM’ 98, pp. 43–54, 1998.
P. Barford, and M. Crovella. Generating representative Web workloads for network and server performance evaluation,” Proceedings of ACM SIGMETRICS, 1998.
A. Thomasian, “Distributed Optimistic Concurrency Control Methods for High-Performance Transaction Processing,” IEEE Transactions on Knowledge and Data Engineering, vol. 10, no. 1, pp. 173–189, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cho, S. (2003). A Hybrid Concurrency Control with Deadlock-free Approach. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds) Computational Science and Its Applications — ICCSA 2003. ICCSA 2003. Lecture Notes in Computer Science, vol 2668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44843-8_56
Download citation
DOI: https://doi.org/10.1007/3-540-44843-8_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40161-2
Online ISBN: 978-3-540-44843-3
eBook Packages: Springer Book Archive