Abstract
Popular conception has been that timestamp ordering concurrency control (CC) yields poor transaction processing performance in relation to twophase locking (2PL). This paper makes two contributions. First, we show the surprising result that Basic Timestamp Ordering (BTO) performs better than 2PL in all cases except when both data contention and message latency are low. When latency or data contention is high, BTO significantly outperforms 2PL. Our second contribution is a new timestamp ordering CC technique (PREDICT) that performs better than 2PL and BTO under low data contention, and continues to perform well under high data contention. We evolve a set of variants of PREDICT, and demonstrate that PREDICT achieves a good balance between lost opportunity cost and restart cost, and outperforms popular CC techniques.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bernstein P.A., Hadzilacos V., Goodman N.: Concurrency Control and Recovery in Database Systems, Addison-Wesley, 1987.
Gray J.N., Reuter A.: Transaction Processing: Concepts and Facilities, Morgan-Kaufmann, 1992.
Thomasian A.: Concurrency Control: Methods, Performance, and Analysis, ACM Computing Surveys 30/1, Mar. 1998, pp 70–119.
Yu P., Wu K., Lin K., Son S.: On Real-Time Databases: Concurrency Control and Scheduling, Proc. of the IEEE 82/1, Jan. 1994.
Ryu I.K., Thomasian A.: Performance Analysis of Dynamic Locking with the No-Waiting Policy, IEEE Trans. on Software Engg. 16/7, pp 684–698, Jul. 1990.
Lin, Nolte: Basic Timestamp, Multiple Version Timestamp and 2-Phase Locking, Proc. of the 9th VLDB Conf., Nov. 1983.
Carey M., Livny: Conflict Detection Tradeoffs for Replicated Data, ACM Transactions on Database Systems 16/4, pp 703–746, Dec. 1991.
Cristian F.: Probabilistic Clock Synchronization, Distributed Computing 3, pp 146–158, 1989.
Wang J., Keshav S.: Efficient and Accurate Ethernet Simulation, Proc. of the 24th Conf. on Local Computer Networks (LCN’ 99), Oct. 1999.
Adya A., Gruber R., Liskov B., Maheshwari U.: Efficient Optimistic Concurrency Control Using Loosely Synchronized Clocks, Proc. of the ACM SIGMOD Int. Conf. on the Management of Data, May 1995.
Mills D.L.: Network Time Protocol: Specification and Implementation, DARPA-Internet Report RFC 1059, DARPA, Jul. 1988.
Cristian F.: Synchronous Atomic Broadcast for Redundant Broadcast Channels, IBM Research Report RJ 7203, Dec. 1989.
Franaszek, Robinson: Distributed Concurrency Control Based on Limited Wait Depth, IEEE Trans. on Parallel and Distributed Systems 4/11, Nov. 1993, pp 1246–1264.
Srinivasa R., Williams C., Reynolds P.F.: Distributed Transaction Processing on an Ordering Network, Technical Report CS-2001-08, Dept. of Computer Science, Univ. of Virginia, Feb. 2001.
Tay Y., Goodman N., Suri R.: Locking Performance in Centralized Databases, ACM Trans. on Database Systems 10/4, Dec. 1985, pp 415–462.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Srinivasa, R., Williams, C., Reynolds, P.F. (2001). A New Look at Timestamp Ordering Concurrency Control. In: Mayr, H.C., Lazansky, J., Quirchmayr, G., Vogel, P. (eds) Database and Expert Systems Applications. DEXA 2001. Lecture Notes in Computer Science, vol 2113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44759-8_91
Download citation
DOI: https://doi.org/10.1007/3-540-44759-8_91
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42527-4
Online ISBN: 978-3-540-44759-7
eBook Packages: Springer Book Archive