Title

On the Composition and Decomposition of Datalog Program Mapping

Document Type

Article

Publication Date

1988

Find in a Library

Catalog Record

Abstract

The composition and decomposition of datalog program mappings are investigated for the purpose of optimization. Composability is studied using an algebraic axiom system. Also considered are (i) the decomposability of a subclass of linear recursive programs into single-rule programs; (ii) the structure of the class of prime programs; and the factorizability of bounded recursive programs into single-rule primes.

Comments

This paper was presented at the 2nd International Conference on Database Theory Bruges, Belgium, August 31 – September 2, 1988 .

DOI

10.1007/3-540-50171-1_5

Catalog Record

Share

COinS