Time-Constrained Transaction Management: Real-Time Constraints in Database Transaction SystemsTransaction processing is an established technique for the concurrent and fault-tolerant access of persistent data. While this technique has been successful in standard database systems, factors such as time-critical applications, emerging technologies, and a re-examination of existing systems suggest that the performance, functionality and applicability of transactions may be substantially enhanced if temporal considerations are taken into account. That is, transactions should not only execute in a `legal' (i.e. logically correct) manner, but they should meet certain constraints with regard to their invocation and completion times. Typically, these logical and temporal constraints are application-dependent. This book addresses some fundamental issues for the management of transactions in the presence of such constraints. Time-Constrained Transaction Management discusses issues regarding timing estimates, the software and hardware architectures, and the target applications; in detail, for some instances. While the research described in this book is based on a specific model, the results may be generalized to others. Therefore, the issues raised, and the techniques developed, represent several fundamental considerations in the management of time-constrained transactions. Time-Constrained Transaction Management provides the basis for new directions in research in diverse areas such as database technology, distributed systems, real-time systems, fault tolerant systems, and scheduling theory. |
Other editions - View all
Common terms and phrases
abort operation aborted transactions actions applications approach assume atomicity clock compensating subtransaction compensating transaction Computer concurrency control module Consider coordinator corresponding CSR restriction CSR schedules data entity data item data-values database Database Transaction DBMS DBMSs deadline decision problem delay denoted described discussed distributed environment distributed TCTM distributed transaction ensure example failures GAC protocol global serializability global SG global track data global transaction intractability results issues logical correctness criteria MDBS multiprocessor scheduling multiset Note NP-hard partial order performance possible precedence order processor random-access memory real numbers regarded represented scheduling theory secondary storage semantics sequence serial schedule set of operations Silberschatz single transaction situation Soparkar stable storage strict 2PL synch operation synchronization protocol T₁ TCTM systems techniques Theorem throughput time-constrained tion topological sort total order traditional transaction executions transaction G transaction management trigger underlying system updates value accrued value function weight function