Abstract
In some database applications, performance requirements are not satisfied by the traditional approach of serializability, in which transactions appear to execute atomically and in isolation on a consistent database state. Although many researchers have investigated the process of decomposing transactions into steps to increase concurrency, the focus of the research is typically on implementing a decomposition supplied by the database application developer, with relatively little attention to what constitutes a desirable decomposition and how the developer should obtain such a decomposition. In our research, we focus on the decomposition process itself.
In [2], we introduced the notion of semantic histories and identified a number of properties which must be satisfied by a decomposition if the decomposition correctly models the original collection of transactions. We also formulated the notion of successor sets to describe efficiently the correct interleavings of steps. In this paper, we develop the successor set constraints more fully, and show how they can be used to take full advantage of conflict serializability at the level of steps. We give a graph-based characterization of correctness of successor set histories, and show how a verified decomposition can be implemented in a two-phase locking environment. We also discuss how the problems related to starvation, deadlocks, and recovery could be addressed.
This work was partially supported by DARPA under grant number N0060-96-D-3202. The work of S. Jajodia was also supported by NSF under grant number IRI-9633541 and by NSA under grants MDA904-96-1-0103 and MDA904-96-1-0104. The work of I. Ray was also supported by a George Mason University Graduate Research Fellowship Award.
Chapter PDF
Similar content being viewed by others
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.
References
D. Agrawal, A. El Abbadi, and A. K. Singh. Consistency and orderability: Semantics-based correctness criteria for databases. ACM Transactions on Database Systems, 18(3):460–486, September 1993.
P. Ammann, S. Jajodia, and I. Ray. Using formal methods to reason about semantics-based decomposition of transactions. In Proceedings of the International Conference on Very Large Data Bases, pages 218–227, Zurich, Switzerland, September 1995.
P. A. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency Control and Recovery in Database Systems. Addison-Wesley, Reading, MA, 1987.
R. Elmasri and S. B. Navathe. Fundamentals of Database Systems. Benjamin/Cummings, Redwood City, CA, 1989.
A. A. Farrag and M. T. Özsu. Using semantic knowledge of transactions to increase concurrency. ACM Transactions on Database Systems, 14(4):503–525, December 1989.
H. Garcia-Molina. Using semantic knowledge for transaction processing in a distributed database. ACM Transactions on Database Systems, 8(2): 186–213, June 1983.
H. Garcia-Molina and K. Salem. Sagas. In Proceedings of ACM-SIGMOD International Conference on Management of Data, pages 249–259, San Francisco, CA, 1987.
H. Garcia-Molina and K. Salem. Services for a workflow management system. Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, 17(1):40–44, March 1994.
M. Herlihy. Extending multiversion time-stamping protocols to exploit type information. IEEE Transactions on Computers, 36(4):443–448, April 1987.
M. P. Herlihy and W. E. Weihl. Hybrid concurrency control for abstract data types. Journal of Computer and System Sciences, 43(1):25–61, August 1991.
H. Wachter and A. Reuter. The ConTract model. In Ahmed K. Elmagarmid, editor, Database Transaction Models for Advanced Applications, pages 219–263. Morgan Kauffman, San Mateo, CA, 1992.
W. E. Weihl. Specification and Implementation of Atomic Data Types. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, 1984.
W. E. Weihl. Commutativity-based concurrency control for abstract data types. IEEE Transactions on Computers, 37(12):1488–1505, December 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jajodia, S., Ray, I., Ammann, P. (1997). Implementing semantic-based decomposition of transactions. In: Olivé, A., Pastor, J.A. (eds) Advanced Information Systems Engineering. CAiSE 1997. Lecture Notes in Computer Science, vol 1250. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63107-0_6
Download citation
DOI: https://doi.org/10.1007/3-540-63107-0_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63107-1
Online ISBN: 978-3-540-69148-8
eBook Packages: Springer Book Archive