Conditional transactions: A model of computation for active databases

Jaideep Srivastava, Kuo Wei Hwang, Wei Tek Tsai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper introduces a transaction model for active databases. 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. We next prove that conventional 2-phase locking also achieves CCS, and can thus be used in practice.

Original languageEnglish
Title of host publicationProceedings of the15th Annual International Computer Software and Applications Conference, CMPSAC 1991
PublisherIEEE Computer Society
Pages36-41
Number of pages6
ISBN (Electronic)0818621524
DOIs
Publication statusPublished - 1 Jan 1991
Externally publishedYes
Event15th Annual International Computer Software and Applications Conference, CMPSAC 1991 - Tokyo, Japan
Duration: 11 Sep 199113 Sep 1991

Publication series

NameProceedings - International Computer Software and Applications Conference
ISSN (Print)0730-3157

Conference

Conference15th Annual International Computer Software and Applications Conference, CMPSAC 1991
CountryJapan
CityTokyo
Period11/9/9113/9/91

    Fingerprint

ASJC Scopus subject areas

  • Software
  • Computer Science Applications

Cite this

Srivastava, J., Hwang, K. W., & Tsai, W. T. (1991). Conditional transactions: A model of computation for active databases. In Proceedings of the15th Annual International Computer Software and Applications Conference, CMPSAC 1991 (pp. 36-41). [170149] (Proceedings - International Computer Software and Applications Conference). IEEE Computer Society. https://doi.org/10.1109/CMPSAC.1991.170149