Foto Afrati, Manolis Gergatsoulis and Francesca Toni Dept. of Electrical and ...  Home/Search
Context
Related
| lp.doc.ic.ac.uk/UserPage...tcs2002.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lp.doc.ic.ac.uk/Us...bibliography (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Linear 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... (Update)
Similar documents based on text: More All
1.0: Linearizability on Datalog Programs - Afrati, Gergatsoulis, Toni (Correct)
0.5: Chain Queries Expressible by Linear Datalog Programs - Afrati (1997) (Correct)
0.5: On Transformations into Linear Database Logic Programs - Foto Afrati (1996) (Correct)
BibTeX entry: (Update)
@misc{ manolis-linearisability,
author = "Foto Afrati Manolis",
title = "Linearisability on Datalog Programs",
url = "citeseer.ist.psu.edu/619524.html" }
Citations (may not include all citations):166 Unification revisited (context) - Lasser, Maher et al. - 1988
162 The semantics of predicate logic as a programming language (context) - van Emden, Kowalski - 1976
150 Computational Complexity (context) - Papadimitriou - 1994
147 An amateur's introduction to recursive query processing stra.. (context) - Bancilhon, Ramakrishnan - 1986
129 Transformation of logic programs : Foundations and technique.. (context) - Pettorossi, Proietti - 1994
88 Principles of Database and Knowledge-Base Systems (context) - Ullman - 1989
62 Unfoldfold transformation logic program (context) - Sato, transformations et al. - 1984
35 Decidable optimization problems for database logic programs (context) - Cosmadakis, Gaifman et al. - 1988
29 Parallel complexity of logical query programs (context) - Ullman, Van Gelder - 1986
25 Basic transformation operations which preserve computed answ.. (context) - Bossi, Cocco - 1993
24 Data independent recursion in deductive databases (context) - Naughton - 1986
24 The loop absorption and the generalization strategies for th.. (context) - Proietti, Pettorossi - 1993
19 Synthesis of Eureka predicates for developing logic programs (context) - Proietti, Pettorossi - 1990
19 Expressiveness of restricted recursive queries (context) - Afrati, Cosmadakis - 1989
18 An observation on time-storage trade off (context) - Cook - 1974
17 Parallel evaluation of recursive rule queries (context) - Cosmadakis, Kanellakis - 1986
15 Bounds on the propagation of selection into logic programs (context) - Beeri, Kanellakis et al. - 1987
13 Towards an algebraic theory of recursion - Ioannidis, Wong - 1991
12 The parallel complexity of simple chain queries (context) - Afrati, Papadimitriou - 1987
10 A decidable class of bounded recursions (context) - Naughton, Sagiv - 1987
9 Unfoldfold transformation stratified program (context) - fold, stratified et al. - 1991
9 Unfoldfold transformation general logic program wellfounded .. (context) - fold, general et al. - 1993
9 Preservation stronger equivalence unfoldfold logic program t.. (context) - Kanamori, stronger et al. - 1990
6 On transformations into linear database logic programs - Afrati, Gergatsoulis et al. - 1996
6 Linearising non-linear recursion in polynomial time (context) - Saraiya - 1990
6 Parallel complexity of simple logic programs (context) - Afrati, Papadimitriou - 1993
4 Unfoldfold transformation definite clause program - Katzouraki, transformations et al. - 1994
3 A necessary and sufficient condition to linearise doubly rec.. (context) - Zang, Yu et al. - 1990
3 Logic program transformations: Transformation rules and appl.. (context) - Gergatsoulis - 1994
2 Chain queries expressible by linear datalog programs - Afrati, Toni - 1997
2 Decidability and undecidablity results for boundedness of li.. (context) - Vardi - 1988
1 the efficiency of transforming database logic programs (context) - Saraiya - 1995
1 generalized correctnes proof unfoldfold logic program transf.. (context) - Sato, proof et al. - 1986
Documents on the same site (http://www-lp.doc.ic.ac.uk/UserPages/staff/ft/bibliography.html): More
Active Behaviour in Deductive Databases - Sadri, Toni (1996) (Correct)
Chain Queries Expressible by Linear Datalog Programs - Afrati (1997) (Correct)
Argument and Reconciliation - Kowalski, Toni (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC