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.

Contenuti

1 Introduction.- 1.1 Traditional Transactions.- 1.2 Temporal Considerations.- 1.3 Related Work.- 1.4 Overview.- 2 A Model.- 2.1 Centralized Environments.- 2.2 Distributed Executions.- 3 Centralized Scheduling.- 3.1 Performance Metrics.- 3.2 Traditional Scheduling.- 3.3 Optimization in Scheduling.- 3.4 Countering Intractability.- 3.5 Uncertainty in Scheduling.- 4 Distributed Scheduling.- 4.1 Integrating Local Executions.- 4.2 A Synchronization Protocol.- 4.3 Restrictions on Executions.- 4.4 Other Integration Issues.- 4.5 Global Atomic Commitment.- 5 Semantics in Scheduling.- 5.1 Adaptive Commitment.- 5.2 Data-value Partitioning.- 6 Conclusions.- 6.1 Issues in I/O.- 6.2 Scheduling Online.- 6.3 Wider Applicability.- 6.4 In Summary.- References.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Descrizione libreria

I mainly carry imported books from South East Asia / South Asia for readers of all Age Groups.

Visita la pagina della libreria

Informazioni sull?azienda del venditore

PLETOS INC
6931 51st Avenue, WOODSIDE, Woodside, NY, 11377, U.S.A.

Condizioni di vendita e spedizione

Condizioni di vendita

We accept return for those books which are received damamged. Though we take appropriate care in packaing to avoid such situation.

Diritto di recesso

Condizioni di spedizione

Tariffe di spedizione nazionale per U.S.A.

Tariffe di spedizione nazionale per U.S.A.
Quantit� dell?ordine	Da 12 a 19 giorni lavorativi	Da 12 a 14 giorni lavorativi
Primo articolo	EUR 3.42	EUR 6.00

I tempi di consegna sono stabiliti dai venditori e variano in base al corriere e al paese. Gli ordini che devono attraversare una dogana possono subire ritardi e spetta agli acquirenti pagare eventuali tariffe o dazi associati. I venditori possono contattarti in merito ad addebiti aggiuntivi dovuti a eventuali maggiorazioni dei costi di spedizione dei tuoi articoli.