Abstract
Transactional systems are based on two distinct transaction models: the update in place model (UIP) and the deferred update model (DU). When considering typed objects relative to concurrency, the expression of commutativity depends on the transaction model on which it is applied: backward commutativity for the UIP model and forward commutativity for the DU model. These two relationships cannot be compared with regard to the concurrency allowed between transactions, as the executions generated by each model are different. This paper combines backward and forward commutativity relations in a new relationship, named Forward-Backward commutativity. This relationship includes both previous ones and provides more concurrency than the union of both. Furthermore, the paper proposes a new concurrency and recovery protocol using this relation, based on biversion objects. Biversion objects are only needed during concurrent executions.
This research was partly supported by the inter PRC project ”Systèmes à Objets Persistants Répartis”, coordinated by the Ministère de l'Éducation et de la Recherche and by the Centre National de la Recherche Scientifique.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Badrinath, B. R., Ramamritham, K., “Semantics-based concurrency control: beyond commutativity”, ACM Transactions On Database Systems, vol. 17, n. 1, March 1992, pp. 163–199.
Bancilhon, F., Delobel, C., Kanellekis, P., “Building an Object-Oriented Database System: the story of 02”, Morgan Kaufmann Publishers, San Mateo, Cal., 1992.
Bernstein, P. A., Hadzilacos, V., Goodman, N., “Concurrency control and recovery in database systems”, Addison-Wesley Publishing, Reading, Mass., 1987.
Billard, D., Ferrié, J., “Increasing throughput in optimistic concurrency control methods with relative recoverability”, Proc. 7th Innternational Symposium on Computer and Information Sciences (ISCIS 7), Antalaya, October 1992, pp. 137–143.
Boksenbaum, C., Cart, M., Ferrié, J., Pons, J. F., “Concurrent certification by intervals of timestamps in distributed database systems”, IEEE Trans. On Software Engineering, vol. 13, n. 4, April 1987, pp. 409–418.
Cart, M., Ferrié, J., Richy, H., “Contrôle de l'exécution de transactions concurrentes”, Technique et Science Informatiques, vol. 8, n. 3, 1989, pp. 225–240.
Cart, M., Ferrié, J., Guerni, M., Pons, J. F., “The impact of typed objects on the Update In Place and Deferred Update transaction models”, Proc. 9th International Symposium on Computer and Information Sciences (ISCIS 9), Antalaya, November 1994, pp. 89–96.
Gray, J., Reuter, A., “Transaction Processing”, Morgan Kaufmann Publishers, San Mateo, Cal., 1993.
Guerni, M., “Implementation techniques of the transactional Deferred Update model when exploiting typed objects in distributed systems”, Proc. European Research Seminar on Advances in Distributed Systems, Grenoble, April 1995, pp.177–182.
Guerni, M., “The impact of typed objects on the deferred update transactional model for concurrency and recovery”, PhD. thesis, Montpellier II University (planed in 1995).
Haerder, T., Reuter, A., “Principles of transaction-oriented database recovery”, ACM Computing Surveys, vol. 15, n. 4, December 1983, pp. 287–317.
Halici, U., Dogac, A., “Concurrency control in distributed databases through time intervals and short-term locks”, IEEE Trans. On Software Engineering, vol. 15, n. 8, April 1987, pp. 994–1003.
Hærder, T., “Observation on optimistic concurrency control schemes”, Information Systems 9, June 1984, pp. 111–120.
Herlihy, M., “Extending multiversion timestamping protocols to exploit type information”, IEEE Trans. On Computer, vol. 35, n. 4, April 1987, pp. 443–449.
Herlihy, M., “Apologizing versus asking permission: Optimistic concurrency control for abstract data types”, ACM Transactions On Database Systems, vol. 15, n. 1, March 1990, pp. 96–124.
Herlihy, M., “Hybrid concurrency control for abstract data types”, Journal Of Computer and System Science, vol. 43, n. 1, August 1991, pp. 25–61.
Korth, H. F., “Locking primitives in a database system”, Journal of the ACM, vol. 30, n. 1, January 1983, pp. 55–79.
Kung, H. T., Robinson, J. T., “On optimistic methods for concurrency control”, ACM Transactions On Database Systems, vol. 6, August 1984, pp. 213–226.
Mohan, C., Haderle, D., Lindsay, B. G., Pirahesh, H., Schwarz, P. M., “ARIES: a transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging”, ACM Transactions On Database Systems, vol. 17, n. 1, March 1992, pp. 94–162.
Nakajima, T., Tokoro, M., “Concurrency control and recovery on multiversion objects”, Int. Workshop on transactions and objects (in conjunction with ECOOP/OOPSLA 90), October 1990.
Özsu, M. T., Valduriez, P., “Principles of Distributed Database Systems”, Prentice Hall, 1991.
Roesler, M., Burkhard, W., “Concurrency control scheme for shared objects: A peephole based on semantics”, Proc. 7th International Conference On distributed Computing Systems, September 1987, pp. 224–231.
Schwarz, P. M., Spector, A. Z., “Synchronizing shared abstract types”, ACM Trans. On Computer Systems, vol. 26, August 1984, pp. 223–250.
Weihl, W. E., “Commutativity-based concurrency control for abstract data types”, IEEE Transactions On Computers, vol. 37, n. 12, December 1988, pp. 1488.–1505.
Weihl, W. E., “The impact of recovery on concurrency control”, Proceedings of the ACM Symposium on Principles Of Database Systems, Philadelphie, March 1989, pp.259–269.
Wong, M. H., Agrawal, D., “Context based synchronization: an approach beyond semantics for concurrency control”, 12th Symposium On Principles of Database Systems, May 1993, pp. 276–287.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guerni, M., Ferrié, J., Pons, JF. (1995). Concurrency and recovery for typed objects using a new commutativity relation. In: Ling, T.W., Mendelzon, A.O., Vieille, L. (eds) Deductive and Object-Oriented Databases. DOOD 1995. Lecture Notes in Computer Science, vol 1013. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60608-4_53
Download citation
DOI: https://doi.org/10.1007/3-540-60608-4_53
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60608-6
Online ISBN: 978-3-540-48460-8
eBook Packages: Springer Book Archive