The Complexity of Concurrency Control for Distributed Databases
Name
MIT-LCS-TR-269.pdf
Size
4.54 MB
Format
Adobe PDF
Checksum (MD5)
028825b5232768fa72bbf2c9d4ffa19b
Author(s)
Kanellakis, Paris C.
Advisor(s)
Papadimitriou, Christos H.
Date Issued
December 1981
Series/Report no.
MIT-LCS-TR-269
Abstract
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.
Persistent DSpace Link
