Publication Type

Conference Proceeding Article

Publication Date

12-1993

Abstract

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.

Discipline

Databases and Information Systems | Numerical Analysis and Scientific Computing

Research Areas

Data Management and Analytics

Publication

ICPADS '93: International Conference on Parallel and Distributed Systems, December 15-17, 1993, Taipei: Proceedings

First Page

440

Last Page

444

Publisher

National Taiwan University

City or Country

Taipei

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Additional URL

http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.8347

Share

COinS