Time-Constrained Transaction Management: Real-Time Constraints in Database Transaction Systems
Springer US, Sep 30, 1996 - Computers - 148 pages
Transaction 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, emerg ing technologies, and a re-examination of existing systems suggest that the performance, functionality and applicability of transactions may be substan tially enhanced if temporal considerations are taken into account. That is, transactions should not only execute in a "legal" (i.e., logically correct) man ner, but they should meet certain constraints with regard to their invocation and completion times. Typically, these logical and temporal constraints are application-dependent, and we address some fundamental issues for the man agement of transactions in the presence of such constraints. Our model for transaction-processing is based on extensions to established mod els, and we briefly outline how logical and temporal constraints may be ex pressed in it. For scheduling the transactions, we describe how legal schedules differ from one another in terms of meeting the temporal constraints. Exist ing scheduling mechanisms do not differentiate among legal schedules, and are thereby inadequate with regard to meeting temporal constraints. This provides the basis for seeking scheduling strategies that attempt to meet the temporal constraints while continuing to produce legal schedules.
36 pages matching assume in this book
Results 1-3 of 36
What people are saying - Write a review
We haven't found any reviews in the usual places.
abort operation aborted transactions actions applications approach assume atomicity autonomy 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 Gp intractability results issues logical correctness criteria LTMi MDBS MDBSi 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 TCTM systems techniques Theorem throughput time-constrained tion topological sort total order traditional transaction executions transaction management trigger underlying system updates value accrued value function weight function