Linearisability on datalog programs

Authors:
Foto Afrati;Manolis Gergatsoulis;Francesca Toni
Affiliations:
Department of Electrical and Computing Engineering, National Technical University of Athens, 157 73 Zographou, Athens, Greece;Department of Archive and Library Sciences, Ionian University, Plateia Eleftherias, Palea Anaktora, 49000 Corfu, Greece;Department of Computing, Imperial College, 180 Queen's Gate, London SW7 2BZ, UK
Venue:
Theoretical Computer Science
Year:
2003

Citing 22
Cited 3

Data independent recursion in deductive databases

PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Parallel evaluation of recursive rule queries

PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
An amateur's introduction to recursive query processing strategies

SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
The parallel complexity of simple chain queries

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Bounds on the propagation of selection into logic programs

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A decidable class of bounded recursions

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Principles of database and knowledge-base systems, Vol. I

Principles of database and knowledge-base systems, Vol. I
Unification revisited

Foundations of deductive databases and logic programming
Decidable optimization problems for database logic programs

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Expressiveness of restricted recursive queries

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Linearising nonlinear recursions in polynomial time

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Necessary and sufficient conditions to linearize doubly recursive programs in logic databases

ACM Transactions on Database Systems (TODS)
Synthesis of eureka predicates for developing logic programs

Proceedings of the third European symposium on programming on ESOP '90
Preservation of stronger equivalence in unfold/fold logic program transformation

Theoretical Computer Science - Special issue on the international conference on fifth generation computer systems. Tokyo, 1988
Towards an algebraic theory of recursion

Journal of the ACM (JACM)
Unfold/fold transformation of stratified programs

Theoretical Computer Science
The parallel complexity of simple logic programs

Journal of the ACM (JACM)
On the efficiency of transforming database logic programs

Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Decidability and undecidability results for boundedness of linear recursive queries

Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)
Unfold/Fold Transformations For Definite Clause Programs

PLILP '94 Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming
On Transformations into Linear Database Logic Programs

Proceedings of the Second International Andrei Ershov Memorial Conference on Perspectives of System Informatics

A Value-propagating Transformation Technique for Datalog Programs Based on Non-Deterministic Constructs

Fundamenta Informaticae
Generating Specialized Rules and Programs for Demand-Driven Analysis

AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
A Value-propagating Transformation Technique for Datalog Programs Based on Non-Deterministic Constructs

Fundamenta Informaticae

Quantified Score

Hi-index	5.23

Visualization

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 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.