PARALLEL COMPLEXITY OF SAMPLE CHAIN QUERIES.

Afrati, Foto; Papadimitriou Christos, H

dc.contributor.author	Afrati, Foto	en
dc.contributor.author	Papadimitriou Christos, H	en
dc.date.accessioned	2014-03-01T02:40:51Z
dc.date.available	2014-03-01T02:40:51Z
dc.date.issued	1987	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/30252
dc.subject.other	COMPUTER PROGRAMMING - Algorithms	en
dc.subject.other	COMPUTER SYSTEMS, DIGITAL - Parallel Processing	en
dc.subject.other	CHAIN QUERIES	en
dc.subject.other	DATALOG	en
dc.subject.other	EXTENDED ABSTRACT	en
dc.subject.other	PARALLEL COMPLEXITY	en
dc.subject.other	PROLOG	en
dc.subject.other	DATABASE SYSTEMS	en
dc.title	PARALLEL COMPLEXITY OF SAMPLE CHAIN QUERIES.	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1145/28659.28682	en
heal.identifier.secondary	http://dx.doi.org/10.1145/28659.28682	en
heal.publicationDate	1987	en
heal.abstract	This article discusses parallel complexity issues in chain queries systems and the degree to which such queries are amenable to parallel evaluation. Chain queries are a syntactically simple yet nontrivial class, containing several interesting examples with contrasting parallel complexity. The article reviews the results by Ullman and Van Gelder and proves the Polynomial Stack Theorem for chain rules. Also the article gives a prove of a sequence of P-completeness results which finally carve out all simple chain rules not shown to be in NC by the polynomial stack theorem.	en
heal.publisher	ACM, New York, NY, USA	en
heal.journalName	[No source information available]	en
dc.identifier.doi	10.1145/28659.28682	en
dc.identifier.spage	210	en
dc.identifier.epage	213	en