Parallel and distributed processing of rules by data-reduction

The parallel evaluation of datalog rule programs, mainly by processors that are interconnected by a communication network, is discussed. Data-reduction, a paradigm for the parallel evaluation of a datalog program, is introduced. Parallelization is accomplished by partitioning the rule-instantiations among the processors. After presenting the paradigm, its implementation with seminaive evaluation, its communication overhead, and its application to stratified-negation datalog programs are discussed. It is proven that decomposability, a related concept introduced in previous works, is undecidable.<
>