Article

Free access

A concurrency control theory for nested transactions (Preliminary Report)

Authors:

P. A. Bernstein,

D. E. ShashaAuthors Info & Claims

PODC '83: Proceedings of the second annual ACM symposium on Principles of distributed computing

Pages 45 - 62

https://doi.org/10.1145/800221.806709

Published: 17 August 1983 Publication History

Abstract

Concurrency control is the activity of synchronizing transactions that access shared data. A concurrency control algorithm is regarded as correct if it ensures that any interleaved execution of transactions is equivalent to a serial one. Such executions are called serializable. Serializability theory provides a method for modelling and analyzing the correctness of concurrency control algorithms [BSW, Pa].

The concept of nested transaction has recently received much attention [GR], [Mo]. In a nested transaction model, each transaction can invoke sub- transactions, which can invoke sub-subtransactions, and so on. The natural modelling concept is the tree log. The leaves of a tree log are atomic operations executed by the underlying system. Internal nodes are operations (as seen by their parents) implemented as transactions (as seen by their children). Nodes are related by a partial order <, where x<y means x executes before y [La].

References

[1]

Attar, R., P.A. Bernstein, and N. Goodman, "Site initialization, Recovery, and Back-up in a Distributed Database Systems," Proc. 6th Berkeley Workshop, Feb. 1982, pp. 185-202.

[2]

Bayer, R., H. Heller, and A. Reiser, "Parallelism and Recovery in Database Systems," ACM Trans. on Database Sys. 5:2 (June 1980), pp. 139-156.

Digital Library

[3]

Bernstein, P.A., and N. Goodman, "Concurrency Control in Distributed Database Systems," ACM Computing Surveys 13, 2 (June 1981), pp. 185-221.

Digital Library

[4]

Bernstein, P.A., and N. Goodman, "A Sophisticate's Introduction to Distributed Database Concurrency Control," Proc. 8th VLDE, Sept. 1982, pp. 62-76.

Digital Library

[5]

Bernstein, P.A., and N. Goodman, "Multi-version Concurrency Control-Theory and Algorithms," Proc. of the ACM SIGACT-SIGOPS Conf. on Principles of Distributed Computation, August 1982, Ottawa.

[6]

Bernstein, P.A., N. Goodman, and M.Y. Lai, "Laying Phantoms to Rest (by Understanding the Interactions Between Schedulers and Translators in a Database System)," Proc. 1981 IEEE COMPSAC Conf., Oct. 1981.

[7]

Bernstein, P.A., D.W. Shipman, and W.S. Wong, "Formal Aspects of Serializability in Database Concurrency Control," IEEE Trans. on Software Engineering, SE-5, 3 (May 1979), 203-215.

Digital Library

[8]

Chan, A., S. Fox, W.T. Lin, A. Nori, and D. Ries, "The Implementation of an Integrated Concurrency Control and Recovery Scheme," Proc. 1982 ACM SIGMOD Conf., ACM, N.Y.

Digital Library

[9]

Dubourdieu, D.J., "Implementation of Distributed Transactions," Proc. 1982 Berkeley Workshop on Distributed Data Management and Computer Networks, pp. 81-94.

[10]

Eswaran, K.P., Gray, J.N., Lorie, R.A., and Traiger, I.L., "The Notions of Consistency and Predicate Locks in a Database Systems," Communications of the ACM, vol. 19, No. 11, November 1976.

Digital Library

[11]

Fischer, J.J., Griffeth, N.D., and N.A. Lynch, "Global States of a Distributed System," Proc. 1st IEEE Annual Symp. on Reliability in Distributed Software and Database Systems, 1981, pp. 31-38.

[12]

Gray, J., "The Transaction Concept: Virtues and Limitations," Proc. 7th International Conf. on Very Large Data Bases, Cannes, Sept. 1981, pp. 144-154.

[13]

Kwong, Y.S., and Wood, D., "A New Method for Concurrency in B-trees," IEEE Trans. Softw. Eng. SE-8, 3 (May 1982), pp. 211-222.

Digital Library

[14]

Lamport, L., "Time, Clocks, and the Ordering of Events in a Distributed System," CACM, 21, 7 (July 1978), pp. 558-565.

Digital Library

[15]

Lehman, P.L., and Bing Yao, S., "Efficient Locking for Concurrent Operations on B-Trees," ACM TODS 6:4 (Dec. 1981), pp. 650-670.

Digital Library

[16]

Liskov, B., and W. Weihl, "Specification and Implementation of Resilient, Atomic Data Types," Manuscript, MIT Laboratory of Computer Sciences, 1982.

[17]

Lynch, N.A., "Concurrency Control for Resilient Nested Transactions," Proc. 2nd SIGACT-SIGMOD Conf. on Principles of Database Systems, Atlanta, March, 1983.

Digital Library

[18]

Manna, Z., and A. Pnueli, book in preparation, 1983.

[19]

Moss, T.E.B., "Nested Transactions: An Approach to Reliable Distributed Computing," Ph.D. Thesis, MIT Laboratory for Computer Science, 1981.

[20]

Papadimitriou, C.H., "Serializability of Concurrent Updates," J. ACM 26:4 (Oct. 1979), pp. 631-653.

Digital Library

[21]

Papadimitriou, C.H., and P.C. Kanellakis, "On Concurrency Control by Multiple Versions," Proc. 1st ACM SIGACT-SIGMOD Conf. on Principles of Database Systems, March 1982.

Digital Library

[22]

Rosenkrantz, D.J., R.E. Stearns, and P.M. Lewis, "System Level Concurrency Control for Distributed Database Systems," ACM TODS 3:2 (June 1978), pp. 178-198.

Digital Library

[23]

Reed, D., "Naming and Synchronization in a Decentralized Computer System," Tech. Rep. MIT/LCS/TR-205, MIT, Dept. of Elec. Eng. and Computer Science, Sept. 1978.

Digital Library

[24]

Silberschatz, A., and Kedem, Z., "Consistency in Hierarchical Database Systems," J. ACM 27:1 (Jan. 1980), pp. 72-80.

Digital Library

[25]

Schwartz, P., and Spector, A., "Synchronizing Shared Abstract Types," Tech. Rep. CMU-CS-82-128, CMU Dept. of Computer Science, Sept. 1982.

[26]

Stearns, R.E., P.M. Lewis II, and D.J. Rosenkrantz, "Concurrency Controls for Data-base Systems," Proc. 17th Symp. on Foundations of Computer Science, IEEE, N.Y., 1976, pp. 19-32.

[27]

Stearns, R.E., and D.J. Rosenkrantz, "Distributed Database Concurrency Controls Using Before-Values," Proc. 1981 ACM-SIGMOD Conf., ACM, N.Y., pp. 74-83.

Digital Library

Cited By

Reznichenko V(2021)60 Years of DatabasesPROBLEMS IN PROGRAMMING10.15407/pp2021.03.040(040-071)Online publication date: Sep-2021
https://doi.org/10.15407/pp2021.03.040
Ferrara PTripp OLiu PKoskinen E(2017)Using Abstract Interpretation to Correct Synchronization FaultsVerification, Model Checking, and Abstract Interpretation10.1007/978-3-319-52234-0_11(187-208)Online publication date: 12-Jan-2017
https://doi.org/10.1007/978-3-319-52234-0_11
Koskinen EParkinson MHerlihy M(2010)Coarse-grained transactionsACM SIGPLAN Notices10.1145/1707801.170630445:1(19-30)Online publication date: 17-Jan-2010
https://dl.acm.org/doi/10.1145/1707801.1706304
Show More Cited By

Index Terms

A concurrency control theory for nested transactions (Preliminary Report)
1. Information systems
  1. Data management systems
    1. Database design and models
      1. Physical data models
    2. Database management system engines
      1. Database transaction processing

Recommendations

Safe open-nested transactions through ownership
PPoPP '09

Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore ``low-level'' memory operations of an open-nested transaction when detecting conflicts ...
Safe open-nested transactions through ownership
PPoPP '09: Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming

Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore ``low-level'' memory operations of an open-nested transaction when detecting conflicts ...
Synchronization in nested transactions

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODC '83: Proceedings of the second annual ACM symposium on Principles of distributed computing

August 1983

305 pages

ISBN:0897911105

DOI:10.1145/800221

Copyright © 1983 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 August 1983

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

44
Total Citations
View Citations
436
Total Downloads

Downloads (Last 12 months)40
Downloads (Last 6 weeks)10

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Reznichenko V(2021)60 Years of DatabasesPROBLEMS IN PROGRAMMING10.15407/pp2021.03.040(040-071)Online publication date: Sep-2021
https://doi.org/10.15407/pp2021.03.040
Ferrara PTripp OLiu PKoskinen E(2017)Using Abstract Interpretation to Correct Synchronization FaultsVerification, Model Checking, and Abstract Interpretation10.1007/978-3-319-52234-0_11(187-208)Online publication date: 12-Jan-2017
https://doi.org/10.1007/978-3-319-52234-0_11
Koskinen EParkinson MHerlihy M(2010)Coarse-grained transactionsACM SIGPLAN Notices10.1145/1707801.170630445:1(19-30)Online publication date: 17-Jan-2010
https://dl.acm.org/doi/10.1145/1707801.1706304
Koskinen EParkinson MHerlihy MHermenegildo MPalsberg J(2010)Coarse-grained transactionsProceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/1706299.1706304(19-30)Online publication date: 17-Jan-2010
https://dl.acm.org/doi/10.1145/1706299.1706304
Herlihy MKoskinen EChatterjee SScott M(2008)Transactional boostingProceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming10.1145/1345206.1345237(207-216)Online publication date: 20-Feb-2008
https://dl.acm.org/doi/10.1145/1345206.1345237
Weikum G(2005)Enhancing concurrency in layered systemsHigh Performance Transaction Systems10.1007/3-540-51085-0_48(200-219)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-51085-0_48
Vidyasankar K(2005)Serializable graphsGraph-Theoretic Concepts in Computer Science10.1007/3-540-50728-0_38(107-121)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-50728-0_38
Beeri CSchek HWeikum G(2005)Multi-level transaction management, theoretical art or practical need?Advances in Database Technology—EDBT '8810.1007/3-540-19074-0_51(134-154)Online publication date: 24-May-2005
https://doi.org/10.1007/3-540-19074-0_51
Lausen GSoisalon-Soininen EWidmayer P(2005)Towards online schedulers based on Pre-Analysis LockingICDT '8610.1007/3-540-17187-8_40(242-259)Online publication date: 2-Jun-2005
https://doi.org/10.1007/3-540-17187-8_40
Eiter TFaber WLeone NPfeifer GPolleres A(2004)A logic programming approach to knowledge-state planningACM Transactions on Computational Logic10.1145/976706.9767085:2(206-263)Online publication date: 1-Apr-2004
https://dl.acm.org/doi/10.1145/976706.976708
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents