The Complexity of Concurrency Control for Distributed Databases
Author(s)
Kanellakis, Paris C.
DownloadMIT-LCS-TR-269.pdf (4.535Mb)
Advisor
Papadimitriou, Christos H.
Metadata
Show full item recordAbstract
This study is an analysis of the distributed version of data base concurrency control. It provides concrete mathematical evidence that the distributed problem is an inherently more complex task than the centralized one. The notions of transaction, concurrency, history, serializability, scheduler, etc, for centralized databases are now well-understood both from a theoretical and a practical point of view.
Date issued
1981-12Series/Report no.
MIT-LCS-TR-269