Abstract
Consider the problem of locking two transactions A and B, each a linear sequence of atomic database steps. Let a fixpoint H be a subset of all possible shuffles of the steps of A and B. [Papadimitriou-82] gave a necessary and sufficient condition for H to be realizable as the set of all sequences of steps “legal” under some locking program. This paper addresses two questions his work left unanswered. First, how many locks are required to realize a given fixpoint set? Second, what sets are realizable as fixpoints of a locking program in the case of three or more transactions? Here, in response to the first query, we demonstrate that for two transactions, any fixpoint set which satisfies this condition may be realized with O(m 2 n) locks, while for three or more transactions, we show the existence of realizable fixpoint sets which require a number of locks exponential in the number of transaction steps. We also give a partial response to the second query, by developing necessary conditions for the realization of fixpoints which involve three transactions.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This work supported by contract N39-84-C-0211 (the Knowledge Base Management Systems Project, Prof. Gio Wiederhold, Principal Investigator) from the Defense Advanced Research Projects Agency.
Preview
Unable to display preview. Download preview PDF.
References
C.H. Papadimitriou “A Theorem in Database Concurrency Control”, J. ACM, Vol. 29, No. 4, October 1982, pp. 998–1006.
C. H. Papadimitriou “Correction to ‘A Theorem in Database Concurrency Control'”, J. ACM, Vol. 32, No. 3, July 1985, p. 750.
Yannakakis, M., Papadimitriou, C.H., and Kung, H.T. “Locking policies: Safety and freedom from deadlock.” Conf. Rec. 20th Ann. IEEE Symp. on Foundations of Computer Science, San Juan, Puerto Rico, 1979, pp. 283–287.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rathmann, P.K. (1986). The cost of locking. In: Ausiello, G., Atzeni, P. (eds) ICDT '86. ICDT 1986. Lecture Notes in Computer Science, vol 243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17187-8_47
Download citation
DOI: https://doi.org/10.1007/3-540-17187-8_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17187-4
Online ISBN: 978-3-540-47346-6
eBook Packages: Springer Book Archive