Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Organizing long-running activities with triggers and transactions
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The Unified Modeling Language user guide
The Unified Modeling Language user guide
A tour on the TriGS active database system — architectue and implementation
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
PDIS '94 Proceedings of the third international conference on on Parallel and distributed information systems
Chronological scheduling of transactions with temporal dependencies
The VLDB Journal — The International Journal on Very Large Data Bases
Modeling Business Rules with Situation/Activation Diagrams
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Building an Integrated Active OODBMS: Requirements, Architecture, and Design Decisions
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Concurrency Control for Perceivedly Instantaneous Transactions in Valid-Time Databases
TIME '97 Proceedings of the 4th International Workshop on Temporal Representation and Reasoning (TIME '97)
| Hi-index | 0.00 |
Serializability is a prominent correctness criterion for an interleaved execution of concurrent transactions. Serializability guarantees that the interleaved execution of concurrent transactions corresponds to some serial execution of the same transactions. Many important business applications, however, require the system to impose a partial serialization order between transactions pinned to a specific point in time and conventional transactions that attempt to commit before, at, or after that point in time. This paper introduces temporal faithfulness as a new correctness criterion for such cases. Temporal faithfulness does not require real-time capabilities but ensures that the serialization order of a set of business transactions is not in conflict with precedence requirements between them. The paper also shows how a temporally faithful transaction scheduler can be built by extending proven scheduling techniques.