|
|
|
@inproceedings{DBLP:conf/sigmod/BernsteinHM90,
author = {Philip A. Bernstein and
Meichun Hsu and
Bruce Mann},
editor = {Hector Garcia-Molina and
H. V. Jagadish},
title = {Implementing Recoverable Requests Using Queues},
booktitle = {Proceedings of the 1990 ACM SIGMOD International Conference on
Management of Data, Atlantic City, NJ, May 23-25, 1990},
publisher = {ACM Press},
year = {1990},
pages = {112-122},
ee = {http://doi.acm.org/10.1145/93597.98721, db/conf/sigmod/BernsteinHM90.html},
crossref = {DBLP:conf/sigmod/90},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
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.
Copyright © 1990 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.
CDROM Version: Load the CDROM "Volume 1 Issue 2, SIGMOD '75-'92" and ...
,
SIGMOD Record 19(2), June 1990