Algorithmic aspects of multiversion concurrency control

Hadzilacos, T; Papadimitriou, CH

dc.contributor.author	Hadzilacos, T	en
dc.contributor.author	Papadimitriou, CH	en
dc.date.accessioned	2014-03-01T01:06:32Z
dc.date.available	2014-03-01T01:06:32Z
dc.date.issued	1986	en
dc.identifier.issn	0022-0000	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/9450
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0022134807&partnerID=40&md5=d0d7370208eef4358355248d42ddf24d	en
dc.subject.classification	Computer Science, Hardware & Architecture	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.other	COMPUTER PROGRAMMING - Algorithms	en
dc.subject.other	COMPLEXITY	en
dc.subject.other	MULTIVERSION CONCURRENCY CONTROL	en
dc.subject.other	MULTIVERSION SERIALIZABILITY	en
dc.subject.other	NP-COMPLETENESS	en
dc.subject.other	ON-LINE SCHEDULABLE SUBSETS	en
dc.subject.other	DATABASE SYSTEMS	en
dc.title	Algorithmic aspects of multiversion concurrency control	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	1986	en
heal.abstract	Multiversion schedulers are now a widely accepted method for enhancing the performance of the concurrency control component of a database. In this paper we introduce a new notion of multiversion serializability (MVSR) based on conflicts (MVCSR), and discuss its relation with the well known single version conflict serializability (CSR). On-line schedulable (OLS) subsets of (MVSR) were defined in Papadimitriou and Kanellakis, ACM Trans. Database Systems 9, No. 1 (1984). We prove there that it is NP-complete to decide whether a set of schedules is OLS. We next introduce the concept of maximal OLS sets, and show that no efficient scheduler can be designed that recognizes maximal subsets of the MVSR or MVCSR schedules. © 1986.	en
heal.publisher	ACADEMIC PRESS INC JNL-COMP SUBSCRIPTIONS	en
heal.journalName	Journal of Computer and System Sciences	en
dc.identifier.isi	ISI:A1986F176000009	en
dc.identifier.volume	33	en
dc.identifier.issue	2	en
dc.identifier.spage	297	en
dc.identifier.epage	310	en