Show simple item record

dc.contributor.authorΓεργατσούλης, Μανώληςel_GR
dc.contributor.authorΑφράτη, Φώτοel_GR
dc.contributor.authorToni, F.en
dc.contributor.authorGergatsoulis, Manolisen
dc.contributor.authorAfrati, Fotoen
dc.descriptionΠεριέχει το πλήρες κείμενοel_GR
dc.description.abstractLinear Datalog programs are programs whose clauses have at most one intensional atom in their bodies. We explore syntactic classes of Datalog programs (syntactically non-linear) which turn out to express no more than the queries expressed by linear Datalog programs. In particular, we investigate linearisability of (database queries corresponding to) piecewise linear Datalog programs and chain queries: (a) We prove that piecewise linear Datalog programs can always be transformed into linear Datalog programs, by virtue of a procedure which performs the transformation automatically. The procedure relies upon conventional logic program transformation techniques. (b) We identify a new class of linearisable chain queries, referred to as pseudo-regular, and prove their linearisability constructively, by generating, for any given pseudo-regular chain query, the Datalog program corresponding to it.en
dc.sourceTheoretical Computer Science Volume 308, Issue 1-3, 3 November 2003, Pages 199-226en
dc.titleLinearisability on datalog programsen
dc.subject.uncontrolledtermDeductive Databasesen
dc.subject.uncontrolledtermDatabase queriesen
dc.subject.uncontrolledtermDatalog programsen
dc.subject.uncontrolledtermProgram optimisationen
dc.subject.uncontrolledtermProgram transformationen
dc.subject.JITAΤεχνολογίες πληροφόρησης και τεχνολογίες βιβλιοθηκών, Συστήματα διαχείρισης βάσεων δεδομένωνel_GR
dc.subject.JITAInformation technology and library technology, Data base management systemsen

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record