article

Free access

Implementing recoverable requests using queues

Authors:

Philip A. Bernstein,

Bruce MannAuthors Info & Claims

ACM SIGMOD Record, Volume 19, Issue 2

Pages 112 - 122

https://doi.org/10.1145/93605.98721

Published: 01 May 1990 Publication History

Abstract

Transactions have been rigorously defined and extensively studied in the database and transaction processing literature, but little has been said about the handling of the requests for transaction execution in commercial TP systems, especially distributed ones, managing the flow of requests is often as important as executing the transactions themselves.

This paper studies fault-tolerant protocols for managing the flow of transaction requests between clients that issue requests and servers that process them. We discuss how to implement these protocols using transactions and recoverable queuing systems. Queuing systems are used to move requests reliably between clients and servers. The protocols use queuing systems to ensure that the server processes each request exactly once and that a client processes each reply at least once. We treat request-reply protocols for single-transaction requests, for multi-transaction requests, and for requests that require interaction with the display after the request is submitted.

References

[1]

Bernstein, P, V Hadzll~cos, and N Goodman, Concurrenc~l Control and Recovery m Database Systems, Addison-Wesley, Read- Ing, MA, 1987

Digital Library

[2]

Blrrell, A D, and B J Nelson "implementing Remote Procedure Calls," A CM Tnzns on Computer Sya, Vol 2, No 1 (Feb 1984), pp 39-59

Digital Library

[3]

"Implementing Location Independent Invocation," Proc 9th Int 'l Conf on Dzst'd Computing Systems, June 1989, pp 550-559

[4]

Digital Eqmpment Corp, DECmtact Transactmn Processmg System Apphcatzon Programming Guzde, Maynard, MA, 1988 Order Number AA-KZ03A-TE

[5]

Garcla-Mohna, H and K Salem, "Sagas," Proc A CM SIGMOD Conf, May 1987

Digital Library

[6]

Gray, 3, "Notes on Database Operating Systems," Operatzng Sys, An Adanced Course (Ed by R Bayer, R M Graham, G Seegmuller), Lecture Notes m Computer Science 60, Sprmger- Verlag, N Y, 1978, pp 393-481 Section 4 on "Data Communications" Is on pp 415-420

Digital Library

[7]

Gray, J, "A Transaction Model," Techmcal Report R32895, IBM Research Laboratory, San Jose, CA, 1980

[8]

Gray, J, "The Transaction Concept Virtues and Limitations" Proc Int'l Conf on VeT Large Data Bases, 1981, pp 144-154

[9]

InternatlonM Business Machines, "CICS/OS/VS Intercommumcations Facilities Guide," Form SC33-0230, White Plains, N Y, 1986

[10]

Jul, E, H Levy, N Hutchinson, and A Black, "Free-Grinned Mobility m the Emerald System," A CM Tnzns on Computer Sys, Vol 6, No 1 (Feb '88), pp 109-133

Digital Library

[11]

Klein, J and A Reuter, "MI- grating Transactions," Future Trends m Dzstr~buted Computer Systems m the 'gOs, Hong Kong, 1988

[12]

Llskov, B, T Bloom, D Glfford, R Schelfler, and W Weihl, "Commumcatlon m the Mercury System," Proc ~lst Hawa~ Conf on System Sczences, Jan 1988 (also, MIT Laboratory for Computer Saence Programming Methodology Group Memo 59, Oct 1987)

Digital Library

[13]

McGee, W C, "The Information Management System IMS/VS Part V Transaction Processlng Faclhtles," IBM Sys Journal, Vol 16, No 2, 1977, pp 148-169

Digital Library

[14]

Pausch, R, "Adding Input and Output to the Transaction Model," Ph D Thesis, Computer Science Dept, Carnegie Mellon Umv, August, 1988 (CMU-CS-88-171)

Digital Library

[15]

The Tandem Database Group, "Non- Stop SQL A Dmtrlbuted, High Performance, High Avatlablhty Implementation of SQL," m Hzgl~ Perf Transactzon S!ts (Ed by D Gawllck, M Hayme, A Reuter), Lecture Notes in Computer Science 359, Spnnger-Verlag, N ~, 1989, pp 60-104

Digital Library

[16]

Wlpfler, A J, "CICS Apphcatlon Development and Programming," Macmillan, N ~, 1987

Digital Library

[17]

Wlpfler, A J, "Distributed Processing m the CICS Environment," McGraw-Hill, N Y, 1989

Digital Library

Cited By

Li TChandramouli BBurckhardt SMadden S(2023)DARQ Matter Binds Everything: Performant and Composable Cloud Programming via Resilient StepsProceedings of the ACM on Management of Data10.1145/35892621:2(1-27)Online publication date: 20-Jun-2023
https://dl.acm.org/doi/10.1145/3589262
Lomet D(2018)Application RecoveryEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_20(123-128)Online publication date: 7-Dec-2018
https://doi.org/10.1007/978-1-4614-8265-9_20
Lomet D(2016)Application RecoveryEncyclopedia of Database Systems10.1007/978-1-4899-7993-3_20-2(1-6)Online publication date: 27-Nov-2016
https://doi.org/10.1007/978-1-4899-7993-3_20-2
Show More Cited By

Index Terms

Implementing recoverable requests using queues
1. Information systems
  1. Data management systems
    1. Database management system engines
      1. Database transaction processing
      2. Parallel and distributed DBMSs
2. Mathematics of computing
  1. Probability and statistics
    1. Statistical paradigms
      1. Queueing theory

Recommendations

Implementing recoverable requests using queues
SIGMOD '90: Proceedings of the 1990 ACM SIGMOD international conference on Management of data

Transactions have been rigorously defined and extensively studied in the database and transaction processing literature, but little has been said about the handling of the requests for transaction execution in commercial TP systems, especially ...
Implementing e-Transactions with Asynchronous Replication
DSN '00: Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)

An e-Transaction is one that executes exactly-once despite failures. This paper describes a distributed protocol that implements the abstraction of e-Transaction in three-tier architectures. Three-tier architectures are typically Internet-oriented ...
Aggregating REST requests to accelerate Web 2.0 applications

Web 2.0 applications often rely on programming techniques that involve Ajax and mashups to provide rich user experiences and remixing of contents. Such techniques allow browser-based clients to communicate with the server using numerous units of ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMOD Record

ACM SIGMOD Record Volume 19, Issue 2

Jun. 1990

392 pages

ISSN:0163-5808

DOI:10.1145/93605

Editor:
H. V. Jagadish
AT&T Bell Laboratories, Murray Hill, NJ

Issue’s Table of Contents

SIGMOD '90: Proceedings of the 1990 ACM SIGMOD international conference on Management of data
May 1990
398 pages
ISBN:0897913655
DOI:10.1145/93597
Chairman:
Hector Garcia-Molina
Princeton Univ., Princeton, NJ

Copyright © 1990 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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1990

Published in SIGMOD Volume 19, Issue 2

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

89
Total Citations
View Citations
806
Total Downloads

Downloads (Last 12 months)110
Downloads (Last 6 weeks)27

Reflects downloads up to 09 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Li TChandramouli BBurckhardt SMadden S(2023)DARQ Matter Binds Everything: Performant and Composable Cloud Programming via Resilient StepsProceedings of the ACM on Management of Data10.1145/35892621:2(1-27)Online publication date: 20-Jun-2023
https://dl.acm.org/doi/10.1145/3589262
Lomet D(2018)Application RecoveryEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_20(123-128)Online publication date: 7-Dec-2018
https://doi.org/10.1007/978-1-4614-8265-9_20
Lomet D(2016)Application RecoveryEncyclopedia of Database Systems10.1007/978-1-4899-7993-3_20-2(1-6)Online publication date: 27-Nov-2016
https://doi.org/10.1007/978-1-4899-7993-3_20-2
Frank L(2012)Architecture for Integrated Mobile Calendar SystemsiMobile Computing Techniques in Emerging Markets10.4018/978-1-4666-0080-5.ch002(23-46)Online publication date: 2012
https://doi.org/10.4018/978-1-4666-0080-5.ch002
Wang RSalzberg BLomet D(2011)Log-based middleware server recovery with transaction supportThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-010-0199-120:3(347-370)Online publication date: 1-Jun-2011
https://dl.acm.org/doi/10.1007/s00778-010-0199-1
Luo GNaughton JEllmann CWatzke M(2010)Transaction reorderingData & Knowledge Engineering10.1016/j.datak.2009.08.00769:1(29-49)Online publication date: 1-Jan-2010
https://dl.acm.org/doi/10.1016/j.datak.2009.08.007
Wang LLu SFei XChebotko AVictoria Bryant HRam J(2009)Atomicity and provenance support for pipelined scientific workflowsFuture Generation Computer Systems10.1016/j.future.2008.06.00725:5(568-576)Online publication date: 1-May-2009
https://dl.acm.org/doi/10.1016/j.future.2008.06.007
Lomet D(2009)Application RecoveryEncyclopedia of Database Systems10.1007/978-0-387-39940-9_20(100-104)Online publication date: 2009
https://doi.org/10.1007/978-0-387-39940-9_20
Meinagh MIsazadeh AAyar MMahmoudi FZareie B(2007)Database Replication with Availability and Consistency Guarantees through Failure-HandlingProceedings of the International Multi-Conference on Computing in the Global Information Technology10.1109/ICCGI.2007.20Online publication date: 4-Mar-2007
https://dl.acm.org/doi/10.1109/ICCGI.2007.20
Meinagh MIsazadeh AZarei BZarei M(2007)Database Replication: AvailAbility aind Consistency Astsrance via Stream Processing2007 IEEE/ACS International Conference on Computer Systems and Applications10.1109/AICCSA.2007.370912(396-403)Online publication date: May-2007
https://doi.org/10.1109/AICCSA.2007.370912
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

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

Figures

Tables

Media

View Issue’s Table of Contents