article

Free access

Using semantic knowledge for transaction processing in a distributed database

Editor: Robert W. Taylor Author:

Hector Garcia-MolinaAuthors Info & Claims

ACM Transactions on Database Systems (TODS), Volume 8, Issue 2

Pages 186 - 213

https://doi.org/10.1145/319983.319985

Published: 01 June 1983 Publication History

Abstract

This paper investigates how the semantic knowledge of an application can be used in a distributed database to process transactions efficiently and to avoid some of the delays associated with failures. The main idea is to allow nonserializable schedules which preserve consistency and which are acceptable to the system users. To produce such schedules, the transaction processing mechanism receives semantic information from the users in the form of transaction semantic types, a division of transactions into steps, compatibility sets, and countersteps. Using these notions, we propose a mechanism which allows users to exploit their semantic knowledge in an organized fashion. The strengths and weaknesses of this approach are discussed.

References

[1]

BERNSTEIN, P.A., SHIPMAN, D.W., AND WONG, W.S. Formal aspects of serializability in database concurrency control. IEEE Trans. Softw. Eng. SE-5, 3 (May 1979), 203-216.

Digital Library

[2]

BERNSTEIN, P.A., SHIPMAN, D.W., AND ROTHNIE, J.B. JR. Concurrency control in a system for distributed databases (SDD-1). ACM Trans. Database Syst. 5, 1 (March 1980), 18-51.

Digital Library

[3]

BERNSTEIN, P.A., AND GOODMAN, N. Concurrency control in distributed database systems. ACM Comput. Surv. 13, 2 (June 1981), 185-221.

Digital Library

[4]

CASANOVA, M.A., AND BERNSTEIN, P.A. General purpose schedulers for database systems. Acta Inf. 4 (1980), 195-220.

Digital Library

[5]

BJORK, L.A. Recovery scenario for a DB/DC system. In Proc. ACM Annual Conf. (Atlanta, Georgia, Aug. 27-29), ACM, New York, I973, pp. 142-146.

Digital Library

[6]

CLARK, D. Oral presentation at the Fifth Berkeley Workshop on Distributed Data Management and Computer Networks (Emeryville, Calif., February 3-5), Lawrence Berkeley Laboratory of the University of California at Berkeley, Berkeley, Calif., 1981.

[7]

DAVIES, C.T., JR. Recovery semantics for a DB/DC system. In Proc. ACM Annual Conf. (Atlanta, Georgia, August 27-29), ACM, New York, 1973, pp. 136-141.

Digital Library

[8]

ELLIS, C.A. Consistency and correctness of duplicate database systems. In Proc. Sixth Symp. Operating System Principles (West Lafayette, Ind., Nov. 16-18), ACM, New York, 1977, pp. 67- 84.

Digital Library

[9]

ESWARAN, K.P., GRAY, J.N., LORIE, R.A., AND TRAIGER, I.L. The notions of consistency and predicate locks in a database system. Commun. ACM 19, 11 {Nov. 1976), 624-633.

Digital Library

[10]

G~AY, J.N., LORIE, R.A., AND PUTZGLU, G.R. Granularity of locks in a shared data base. In Proc. Int. Conf. Very Large Data Bases (Framingham, Mass., Sept. 22-24), ACM, New York, 1975, pp. 428-451.

[11]

GRAY, J.N. Notes on database operating systems. In Operating Systems: An Advanced Course, Advanced Course on Operating System Principles, Technical Univ. Munich (July 1977}.

Digital Library

[12]

GRAY, J.N. A transaction model. Unpublished IBM Research Memo (Feb. 1980).

[13]

GI~A~, J.N. The transaction concept: virtues and limitations. In Proc. Seventh Int. Conf. Very Large Data Bases {Cannes, France, Sept. 9-I1}, ACM, New York, 1981, pp. 144-154.

[14]

KORTH, H.F. Locking protocols: general lock classes and deadlock freedom. Ph.D. dissertation, Dep. Electrical Engineering and Computer Science, Princeton Univ., 1981.

Digital Library

[15]

KUNG, H.T., AND PAPADIMITRIOU, C.H. An optimality theory of concurrency control for databases. In Proc. A CM-SIGMOD Int. Conf. Management of Data (Boston, Mass., May 30-June 1), ACM, New York, 1979, pp. 116-126.

Digital Library

[16]

LIPTON, R.J., VALDES, J., AND SEDGEWmK, R. Programming aspects of VLSI. in Conf. Record Ninth Annual A CM Syrup. Principles of Programming Languages (Albuquerque, New Mex., Jan. 25-27), ACM, New York, 1982, pp. 57-65.

Digital Library

[17]

FISCHER, J.M., GRIFFETH, N.D., AND LYNCh, N.A. Global states of a distributed system. IEEE Trans. Softw. Eng. SE-8, 3 (May 1982), 198-202.

Digital Library

[18]

MEAD, C., AND CONWAY, L. Introduction to VLSI Systems, Addison-Wesley, Reading, Mass., 1980.

Digital Library

[19]

MENASCE, D.A., POPEK, G.J., AND MUNTZ, R.R. A locking protocol for resource coordination in distributed databases. ACM Trans. Database Syst. 5, 2 (June 1980), 103-138.

Digital Library

[20]

OSERMARCK, R. Distributed deadlock detection algorithm. A CM Trans. Database Syst. 7, 2 (June 1982), 187-208.

Digital Library

[21]

PAPADIMITRIOU, C.H. The serializabflity of concurrent database updates. J. ACM 26, 4 (Oct. 1979), 631-653.

Digital Library

[22]

ROSENKRANTZ, D.J., STEARNS, R.E., AND LEWIS, P.M., II System level concurrency control for distributed database systems. ACM Trans. Database Syst. 3, 2 (June 1978), 178-198.

Digital Library

[23]

ROTHNIE, J.B., AND GOODMAN, i. A survey of research and development in distributed database management. In Proc. Third Int. Conf. Very Large Data Bases (Tokyo, Japan, Oct. 6-8), ACM, New York, 1977, pp. 48-62.

Digital Library

[24]

SKEEN, D., ASD STONEBRAKER, M. A formal model of crash recovery in a distributed system. In Proc. Fifth Berkeley Workshop on Distributed Data Management and Computer Networks Lawrence Berkeley Laboratory of the University of California at Berkeley, Berkeley, Calif., 1981, pp. 129-140.

[25]

STONEBRAKER, M. Concurrency control and consistency of multiple copies of data in distributed INGRES. IEEE Trans. Softw. Eng. SE-5, 3 (May 1979), 188-194.

Digital Library

[26]

STRON, B.I. Consistency of redundant databases in a weakly coupled distributed computer conferencing system. In Proc. Fifth Berkeley Workshop on Dgstributed Data Management and Computer Networks (Emeryville, Calif., February 8-5), Lawrence Berkeley Laboratory of the University of California at Berkeley, Berkeley, Calif., 1981, pp. 143-153.

[27]

THOMAS, R.H. A majority consensus approach to concurrency control. ACM Trans. Database Syst. 4, 2 (June 1979), I80-209.

Digital Library

[28]

TRAIGER, I.L., GRAY, J.N., GALTIERI, C.A., AND LINDSAY, B.G. Transactions and consistency in distributed database systems. IBM Tech. Rep. RJ 2555 (June 1979).

Cited By

Wang ZTang CZhang XYu QZang BGuan HChen H(2023)Ad Hoc Transactions through the Looking Glass: An Empirical Study of Application-Level Transactions in Web ApplicationsACM Transactions on Database Systems10.1145/363855349:1(1-43)Online publication date: 23-Dec-2023
https://dl.acm.org/doi/10.1145/3638553
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
Cooper ALevy KDe Sa C(2021)Accuracy-Efficiency Trade-Offs and Accountability in Distributed ML SystemsProceedings of the 1st ACM Conference on Equity and Access in Algorithms, Mechanisms, and Optimization10.1145/3465416.3483289(1-11)Online publication date: 5-Oct-2021
https://dl.acm.org/doi/10.1145/3465416.3483289
Show More Cited By

Index Terms

Using semantic knowledge for transaction processing in a distributed database
1. Computer systems organization
  1. Architectures
    1. Distributed architectures
2. Information systems
  1. Data management systems
    1. Database management system engines
      1. Database transaction processing
      2. Parallel and distributed DBMSs

Recommendations

Read-only transactions in a distributed database

A read-only transaction or query is a transaction which does not modify any data. Read-only transactions could be processed with general transaction processing algorithms, but in many cases it is more efficient to process read-only transactions with ...
Locking Timestamps versus Locking Objects
PODC '18: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing

We present multiversion timestamp locking (MVTL), a new genre of multiversion concurrency control algorithms for serializable transactions. The key idea behind MVTL is simple: lock individual timestamps instead of locking objects. After presenting a ...
Transaction chopping: algorithms and performance studies

Chopping transactions into pieces is good for performance but may lead to nonserializable executions. Many researchers have reacted to this fact by either inventing new concurrency-control mechanisms, weakening serializability, or both. We adopt a ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Database Systems

ACM Transactions on Database Systems Volume 8, Issue 2

June 1983

120 pages

ISSN:0362-5915

EISSN:1557-4644

DOI:10.1145/319983

Editor:
Robert W. Taylor
IBM Research Lab, San Jose, CA

Issue’s Table of Contents

Copyright © 1983 ACM.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1983

Published in TODS Volume 8, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

363
Total Citations
View Citations
2,262
Total Downloads

Downloads (Last 12 months)153
Downloads (Last 6 weeks)16

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Wang ZTang CZhang XYu QZang BGuan HChen H(2023)Ad Hoc Transactions through the Looking Glass: An Empirical Study of Application-Level Transactions in Web ApplicationsACM Transactions on Database Systems10.1145/363855349:1(1-43)Online publication date: 23-Dec-2023
https://dl.acm.org/doi/10.1145/3638553
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
Cooper ALevy KDe Sa C(2021)Accuracy-Efficiency Trade-Offs and Accountability in Distributed ML SystemsProceedings of the 1st ACM Conference on Equity and Access in Algorithms, Mechanisms, and Optimization10.1145/3465416.3483289(1-11)Online publication date: 5-Oct-2021
https://dl.acm.org/doi/10.1145/3465416.3483289
Xu JAckerer DDubovitskaya A(2021)A Game-Theoretic Analysis of Cross-Chain Atomic Swaps with HTLCs2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS51616.2021.00062(584-594)Online publication date: Jul-2021
https://doi.org/10.1109/ICDCS51616.2021.00062
Ren KLi DAbadi D(2019)SLOGProceedings of the VLDB Endowment10.14778/3342263.334264712:11(1747-1761)Online publication date: 1-Jul-2019
https://dl.acm.org/doi/10.14778/3342263.3342647
Nawab F(2019)Coordination AvoidanceEncyclopedia of Big Data Technologies10.1007/978-3-319-77525-8_182(519-525)Online publication date: 20-Feb-2019
https://doi.org/10.1007/978-3-319-77525-8_182
Vidyasankar K(2018)Consistency of Continuous Queries in Fog ComputingProcedia Computer Science10.1016/j.procs.2018.10.124141(16-23)Online publication date: 2018
https://doi.org/10.1016/j.procs.2018.10.124
Nawab F(2018)Coordination AvoidanceEncyclopedia of Big Data Technologies10.1007/978-3-319-63962-8_182-1(1-7)Online publication date: 6-Feb-2018
https://doi.org/10.1007/978-3-319-63962-8_182-1
Trofimov A(2018)Consistency Maintenance in Distributed Analytical Stream ProcessingNew Trends in Databases and Information Systems10.1007/978-3-030-00063-9_38(413-422)Online publication date: 31-Aug-2018
https://doi.org/10.1007/978-3-030-00063-9_38
Salem K(2018)SagasEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_724(3273-3273)Online publication date: 7-Dec-2018
https://doi.org/10.1007/978-1-4614-8265-9_724
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 Article

Media

Figures

Other

Tables

View Issue’s Table of Contents