This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Parallel and Distributed Processing of Rules by Data-Reduction
June 1993 (vol. 5 no. 3)
pp. 523-530

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] K. Apt, H. Blair, and A. Walker, "Towards a Theory of Declarative Knowledge,"Proc. Workshop Foundations Deductive Databases and Logic Programming, Washington D.C., 1988, pp. 546-629.
[2] R. Agrawal and H. V. Jagadish, "Multiprocessor transitive closure algorithms," inProc. Int. Symp. Databases in Distributed and Parallel Systems, Austin, TX, Dec. 1989.
[3] F. Bancilhon and R. Ramakrishnan, "Performance evaluation of data intensive logic programs," inProc. Workshop Foundation of Deductive Databases and Logic Programming, Washington, DC, Aug. 1986.
[4] S. R. Cohen and O. Wolfson, "Why a single parallelization strategy is not enough in knowledge bases," inProc. ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, Philadelphia, Mar. 1989, pp. 200-216.
[5] G. Dong, "On distributed processibility of logic programs by decomposing databases," inProc. ACM-SIGMOD conf., 1989.
[6] S. Ganguly, A. Silberschatz, and S. Tsur, "A framework for the parallel processing of datalog queries," inProc. ACM-Sigmod Int. Conf. on Management of Data, 1990.
[7] H. Gaifman, H. Mairson, and Y. Sagiv, and M. Y. Vardi, "Undecidable optimization problems for database logic programs," inProc. Logic in Comput. Sci. Conf., 1987.
[8] M. W. Houtsma, P. M. G. Apers, and S. Ceri, "Parallel computation of transitive closure queries on fragmented databases," inProc. VLDB Conf., 1990.
[9] T. Ishida, S.J. Stolfo, "Towards the parallel execution of rules in production system programs,"Proc. 13th Annu. Int. Symp. Comput. Architecture, IEEE/ACM, 1986, pp. 28-37.
[10] D. P. Miranker, C. M. Kuo, J. C. Browne, "Parallelizing compilation of production rule programs," inProc. Int. Conf. Parallel Processing, 1990.
[11] D. Maier and D. S. Warren,Computing with Logic: Introduction to Logic Programming. London: Benjamin-Cummings, 1987.
[12] F. Mattern, "Algorithms for distributed termination detection,"Distributed Computing, 1987.
[13] F. Mattern, "Global quiescence detection based on credit distribution and recovery," to appear,Inform. Processing Lett..
[14] A. J. Pasik, "A methodology for programming production systems and its implications on parallelism," Ph.D. dissertation, Dep. Comput. Sci., Columbia Univ., 1989.
[15] R. Ramakrishnan, "Parallelism in logic programs," inProc. ACM Symp. POPL, 1990.
[16] L. Raschid, T. Sellis, and C. C. Lin, "Exploiting Concurrency in a DBMS implementation of production systems," inProc. Int. Symp. Databases in Distributed and Parallel Syst., Austin TX, Dec. 1989.
[17] O. Shmueli, "Decidability and expressiveness aspects of logic queries," inProc. ACM SIGACT-SIGMOD Symp. Principles Database Systems, 1987, pp. 237-249.
[18] S. J. Stolfo, "Five parallel algorithms for production system execution on the DADO machine,"Proc. Nat. Conf. Artificial Intell., 1984.
[19] S. J. Stolfo, D. P. Miranker, and R. Mills, "A simple processing scheme to extract and load balance implicit parallelism in the concurrent match of production rules," inProc. AFIPS Symp. Fifth Generation Computing, AFIPS, 1985.
[20] M. F. M. Tenorio and D. I. Moldovan, "Mapping production systems into multiprocessors," inProc. 13th Annu. Int. Symp. Comput. Architecture, IEEE/ACM, 1986.
[21] J. D. Ullman,Database and Knowledge-base Systems. Rockville, MD: Computer Science Press, 1988.
[22] J. D. Ullman and M. Yannakakis, "The input/output complexity of transitive closure," inProc. ACM-SIGMOD Conf., 1990.
[23] P. Valduriez and S. Khoshafian, "Parallel evaluation of the transitive closure of a database relation,"Int. J. Parallel Programming, vol. 17, Feb. 1988.
[24] O. Wolfson and A. Siblerschatz, "Distributed processing of logic programs," inProc. ACM SIGMOD, Chicago, June 1988, pp. 329-336.
[25] O. Wolfson, "Sharing the load of logic program evaluation," inProc. Int. Symp. Databases in Parallel and Distributed Syst., Austin, TX, Dec. 1988.
[26] M. Yannakakis, "Algorithms for acyclic database schemes," inProc. 7th VLDB Conf., 1981.

Index Terms:
parallel processing of rules; distributed processing of rules; data-reduction; datalog rule programs; communication network; rule-instantiations; seminaive evaluation; communication overhead; stratified-negation datalog programs; decomposability; distributed databases; knowledge based systems; logic programming
Citation:
O. Wolfson, A. Ozeri, "Parallel and Distributed Processing of Rules by Data-Reduction," IEEE Transactions on Knowledge and Data Engineering, vol. 5, no. 3, pp. 523-530, June 1993, doi:10.1109/69.224203
Usage of this product signifies your acceptance of the Terms of Use.