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

[1]  Mihalis Yannakakis,et al.  The input/output complexity of transitive closure , 1990, SIGMOD '90.

[2]  Timos K. Sellis,et al.  Exploiting Concurrency in a DBMS Implementation for Production Systems , 1988, Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems.

[3]  Jeffrey D. Ullman,et al.  Principles of database and knowledge-base systems, Vol. I , 1988 .

[4]  H. V. Jagadish,et al.  Multiprocessor Transitive Closure Algorithms , 1988, Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems.

[5]  Ouri Wolfson,et al.  Why a single parallelization strategy is not enough in knowledge bases , 1989, PODS '89.

[6]  Salvatore J. Stolfo.  Five Parallel Algorithms for Production System Execution on the DADO Machine , 1984, AAAI.

[7]  Jeffrey D. Ullman,et al.  Principles Of Database And Knowledge-Base Systems , 1979 .

[8]  Ouri Wolfson,et al.  Sharing The Load Of Logic-program Evaluation , 1988, Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems.

[9]  Harry G. Mairson,et al.  Undecidable optimization problems for database logic programs , 1993, JACM.

[10]  Friedemann Mattern,et al.  Global Quiescence Detection Based on Credit Distribution and Recovery , 1989, Inf. Process. Lett..

[11]  Raghu Ramakrishnan,et al.  Parallelism in logic programs , 1989, POPL '90.

[12]  Guozhu Dong.  On distributed processibility of datalog queries by decomposing databases , 1989, SIGMOD '89.

[13]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[14]  Abraham Silberschatz,et al.  Distributed processing of logic programs , 1988, SIGMOD '88.

[15]  Abraham Silberschatz,et al.  A framework for the parallel processing of Datalog queries , 1990, SIGMOD '90.

[16]  Salvatore J. Stolfo,et al.  A simple preprocessing scheme to extract and balance implicit parallelism in the concurrent match of production rules , 1986 .

[17]  Raghu Ramakrishnan,et al.  Performance Evaluation of Data Intensive Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[18]  Alexander J. Pasik,et al.  A methodology for programming production systems and its implications on parallelism , 1989 .

[19]  Salvatore J. Stolfo,et al.  Towards the Parallel Execution of Rules in Production System Programs , 1985, ICPP.

[20]  Oded Shmueli,et al.  Decidability and expressiveness aspects of logic queries , 1987, XP7.52 Workshop on Database Theory.

[21]  Mihalis Yannakakis,et al.  Algorithms for Acyclic Database Schemes , 1981, VLDB.