Conditional transactions: a model of computation for active databases

Author

Srivastava, Jaideep ; Hwang, Kuo-Wei ; Tsai, Wei-Tek

Author_Institution

Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA

fYear

1991

fDate

11-13 Sep 1991

Firstpage

36

Lastpage

41

Abstract

A transaction model for active databases is introduced. Concurrent execution of rules needs to be carefully managed to ensure consistent semantics. It is shown that serializability is not always sufficient for correctness. A new criterion, conditional conflict serializability (CCS) is developed and shown to ensure the desired correctness. A graph-based scheduler for it is presented. Practical schedulers should also be recoverable, which the graph-based scheduler is not. The authors prove that conventional two-phase locking also achieves CCS, and can thus be used in practice

Keywords

concurrency control; database management systems; database theory; scheduling; transaction processing; active databases; concurrent execution; conditional conflict serializability; conditional transactions; consistent semantics; graph-based scheduler; rules; transaction model; two-phase locking; Carbon capture and storage; Cascading style sheets; Computational modeling; Computer science; Concurrency control; Database languages; Electronics packaging; Iris; Reduced instruction set computing; Transaction databases;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Software and Applications Conference, 1991. COMPSAC '91., Proceedings of the Fifteenth Annual International

Conference_Location

Tokyo

Print_ISBN

0-8186-2152-4

Type

conf

DOI

10.1109/CMPSAC.1991.170149

Filename

170149