T3C: a temporally correct concurrency control algorithm for distributed databases

Boukerche, Azzedine; Tuck, Terry

doi:10.1109/mascot.2000.876440

Cited by 5 publications

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, improved concurrency combined with a non-aggressive synchronization technique requires the predeclaration of the data items to be accessed. Combining this with the requirement for ease of use for the application developer requires that predeclaration be done at other than the data-item level [12,13].…”

Section: Database Modelmentioning

confidence: 99%

“…These two subproblems can be solved independently as long as their solutions are combined in a manner that yields an overall transaction ordering. Decomposing the overall problem into write-write and read-write synchronization problems [12,13,15] also simplifies the presentation of our RF-MVTC algorithm. The design constraint for write operations is that they are executed immediately upon receipt by a local database.…”

Section: Description Of Risk-free Mvtcmentioning

confidence: 99%

See 1 more Smart Citation

RF‐MVTC: an efficient risk‐free multiversion concurrency control algorithm

Boukerche

Tuck

2004

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYIn this paper, we focus on the temporary return of data values that are incorrect for given transactional semantics that could have catastrophic effects similar to those in parallel and discrete event simulation systems. In many applications using online transactions processing environments, for instance, it is best to delay the response to a transaction's read request until it is either known or unlikely that a write message from an older update transaction will not make the response incorrect. Examples of such applications are those where aberrant behavior is too costly, and those in which precommitted data is visible to some reactive entity. In light of the avoidance of risk in this approach, we propose a risk-free multiversion temporally correct concurrency-control algorithm. We discuss the algorithm, its implementation and report on the performance results of simulation models using a cluster of workstations.

show abstract

Section: Database Modelmentioning

confidence: 99%

Section: Description Of Risk-free Mvtcmentioning

confidence: 99%