Is distributed locking harder?

Kanellakis, PC; Papadimitriou, CH

dc.contributor.author	Kanellakis, PC	en
dc.contributor.author	Papadimitriou, CH	en
dc.date.accessioned	2014-03-01T01:06:16Z
dc.date.available	2014-03-01T01:06:16Z
dc.date.issued	1984	en
dc.identifier.issn	0022-0000	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/9284
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0021376085&partnerID=40&md5=dfc1b438446c06f942a39224b07d5280	en
dc.subject.classification	Computer Science, Hardware & Architecture	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.other	DATABASE SYSTEMS	en
dc.title	Is distributed locking harder?	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	1984	en
heal.abstract	The problem of determining whether a set of locked transactions, accessing a distributed database, is guaranteed to produce only serializable schedules is examined. For a pair of transactions, with n steps, it is proved that this concurrency control problem, which is polynomially solvable for centralized databases, is in general coNP-complete. A new graphtheoretic technique is employed and an O(n2) test for the special case of databases distributed between two sites is provided. © 1984.	en
heal.publisher	ACADEMIC PRESS INC JNL-COMP SUBSCRIPTIONS	en
heal.journalName	Journal of Computer and System Sciences	en
dc.identifier.isi	ISI:A1984SH96800006	en
dc.identifier.volume	28	en
dc.identifier.issue	1	en
dc.identifier.spage	103	en
dc.identifier.epage	120	en