The complexity of distributed concurrency control
SIAM Journal on Computing, Volume 14, Issue 1, 1981, Pages 52-74.
We present a formal framework for distributed databases, and we study the complexity of the concurrency control problem in this framework. Our transactions are partially ordered sets, of actions, as opposed to the straight-line programs of the centralized case. The concurrency control algorithm, or scheduler, is itself a distributed progr...More
PPT (Upload PPT)