Is distributed locking harder?

Kanellakis, P; Papadimitriou, C

dc.contributor.author	Kanellakis, P	en
dc.contributor.author	Papadimitriou, C	en
dc.date.accessioned	2014-03-01T02:47:33Z
dc.date.available	2014-03-01T02:47:33Z
dc.date.issued	1982	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33224
dc.subject	Concurrency Control	en
dc.subject	Distributed Database	en
dc.title	Is distributed locking harder?	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1145/588111.588129	en
heal.identifier.secondary	http://dx.doi.org/10.1145/588111.588129	en
heal.publicationDate	1982	en
heal.abstract	We examine the problem of determining whether a set of locked transactions, accessing a distributed database, is guaranteed to produce only serializable schedules. For a pair of transactions we prove that this concurrency control problem (which is polynomially solvable for centralized databases) is in general coNP-complete. We employ a new graph-theoretic technique and provide an efficient test for the special	en
heal.journalName	Symposium on Principles of Database Systems	en
dc.identifier.doi	10.1145/588111.588129	en