Conference Proceeding Article
We propose a new (and restricted) model for global transactions which allows asynchronous commitment of subtransactions. Our model requires each global transaction to have a fixed structure with update to the data in at most one database. Based on this transaction model, we present two concurrency control algorithms, namely Asynchronous Site Graph and Asynchronous VirtGlobalSG, which employ asynchronous commitment and achieve global serializability. Compared to other proposed algorithms, our algorithms employ asynchronous commitment so as to increase transaction performance. Furthermore, our algorithms do not put restrictions on transaction data access or local histories.
Databases and Information Systems | Numerical Analysis and Scientific Computing
Data Management and Analytics
ICPADS '93: International Conference on Parallel and Distributed Systems, December 15-17, 1993, Taipei: Proceedings
National Taiwan University
City or Country
HWANG, San-Yih; LIM, Ee Peng; and SRIVASTAVA, Jaideep.
Asynchronous Transaction Commitment in Federated Database Systems. (1993). ICPADS '93: International Conference on Parallel and Distributed Systems, December 15-17, 1993, Taipei: Proceedings. 440-444. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/909
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.