A value-propagating transformation technique for Datalog programs based on non-deterministic constructs

Potikas, P; Rondogiannis, P; Gergatsoulis, M

dc.contributor.author	Potikas, P	en
dc.contributor.author	Rondogiannis, P	en
dc.contributor.author	Gergatsoulis, M	en
dc.date.accessioned	2014-03-01T01:23:32Z
dc.date.available	2014-03-01T01:23:32Z
dc.date.issued	2006	en
dc.identifier.issn	0169-2968	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/17002
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-33748862818&partnerID=40&md5=2f4314281649cf0c9b3e90e153286926	en
dc.relation.uri	http://iospress.metapress.com/openurl.asp?genre=article&issn=0169-2968&volume=72&issue=4&spage=485	en
dc.relation.uri	http://www.informatik.uni-trier.de/~ley/db/journals/fuin/fuin72.html#PotikasRG06	en
dc.subject	Deductive Databases	en
dc.subject	Logic Programming	en
dc.subject	Non-deterministic Constructs	en
dc.subject	Program and Query Transformations	en
dc.subject.classification	Computer Science, Software Engineering	en
dc.subject.classification	Mathematics, Applied	en
dc.subject.other	Database systems	en
dc.subject.other	Mathematical transformations	en
dc.subject.other	Optimization	en
dc.subject.other	Query languages	en
dc.subject.other	Chain Datalog programs	en
dc.subject.other	Deductive Databases	en
dc.subject.other	Non deterministic Constructs	en
dc.subject.other	Query Transformations	en
dc.subject.other	Logic programming	en
dc.title	A value-propagating transformation technique for Datalog programs based on non-deterministic constructs	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	2006	en
heal.abstract	The branching-time transformation is a recent technique for optimizing Chain Datalog programs. In this paper we propose a significant extension of the branching-time transformation which we believe opens up a promising new direction of research in the area of value-propagating Datalog optimizations. More specifically, the proposed transformation can handle more general programs that allow multiple consumptive occurrences of variables in the bodies of clauses. This extension is achieved by using as target language the temporal logic programming formalism Datalog(n)s enriched with choice predicates (a non-deterministic construct that was originally introduced in the area of intensional logic programming). We demonstrate the correctness of the transformation and propose several optimizations that can be applied to the target code. Moreover, we define a bottom-up proof procedure that applies to the target programs and demonstrate that it always terminates (despite the fact that the Herbrand base of these programs is generally infinite).	en
heal.publisher	IOS PRESS	en
heal.journalName	Fundamenta Informaticae	en
dc.identifier.isi	ISI:000240958700004	en
dc.identifier.volume	72	en
dc.identifier.issue	4	en
dc.identifier.spage	485	en
dc.identifier.epage	527	en