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 language | English (US) |
---|---|
Title of host publication | Proceedings of the15th Annual International Computer Software and Applications Conference, CMPSAC 1991 |
Publisher | IEEE Computer Society |
Pages | 36-41 |
Number of pages | 6 |
ISBN (Electronic) | 0818621524 |
DOIs | |
State | Published - 1991 |
Event | 15th Annual International Computer Software and Applications Conference, CMPSAC 1991 - Tokyo, Japan Duration: Sep 11 1991 → Sep 13 1991 |
Publication series
Name | Proceedings - International Computer Software and Applications Conference |
---|---|
ISSN (Print) | 0730-3157 |
Conference
Conference | 15th Annual International Computer Software and Applications Conference, CMPSAC 1991 |
---|---|
Country/Territory | Japan |
City | Tokyo |
Period | 9/11/91 → 9/13/91 |
Bibliographical note
Publisher Copyright:© 1991 IEEE.