On the convergence of query evaluation

Afrati, F; Papadimitriou, CH; Papageorgiou, G; Roussou, A; Sagiv, Y; Ullman, JD

dc.contributor.author	Afrati, F	en
dc.contributor.author	Papadimitriou, CH	en
dc.contributor.author	Papageorgiou, G	en
dc.contributor.author	Roussou, A	en
dc.contributor.author	Sagiv, Y	en
dc.contributor.author	Ullman, JD	en
dc.date.accessioned	2014-03-01T01:07:33Z
dc.date.available	2014-03-01T01:07:33Z
dc.date.issued	1989	en
dc.identifier.issn	0022-0000	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/10064
dc.subject	Query Evaluation	en
dc.subject.classification	Computer Science, Hardware & Architecture	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.title	On the convergence of query evaluation	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/0022-0000(89)90006-8	en
heal.identifier.secondary	http://dx.doi.org/10.1016/0022-0000(89)90006-8	en
heal.language	English	en
heal.publicationDate	1989	en
heal.abstract	We propose a ""sideways information passing"" method for evaluating Horn clause queries in the presence of monotonicity constraints on the database relations. We give a necessary and sufficient condition for its convergence and show that testing for the condition is polynomial when the arity of the relations is bounded, and PSPACE-complete otherwise. We also prove a related condition for the case of downward finite domains (e.g., Herbrand universes), thus improving an algorithm by Naish for a class of Prolog programs. © 1989.	en
heal.publisher	ACADEMIC PRESS INC JNL-COMP SUBSCRIPTIONS	en
heal.journalName	Journal of Computer and System Sciences	en
dc.identifier.doi	10.1016/0022-0000(89)90006-8	en
dc.identifier.isi	ISI:A1989U434900005	en
dc.identifier.volume	38	en
dc.identifier.issue	2	en
dc.identifier.spage	341	en
dc.identifier.epage	359	en