On distributed processibility of datalog queries by decomposing databases

We consider distributed or parallel processing of datalog queries. We address this issue by decomposing databases into a number of subdatabases such that the computation of a program on a database can be achieved by unioning its independent evaluations on the subdatabases. More specifically, we identify two kinds of distributed-processible programs according to the properties of database decomposition. (i) A program is disjoint distributive if it is distributed processible over a decomposition consisting of subdatabases with disjoint domains. A characterization of such programs is given in terms of an easily decidable syntactic property called connectivity. (ii) A program is bounded distributive if it is distributed processible over a decomposition consisting of subdatabases with a fixed size. Three interesting characterizations of such a program are presented, the first by bounded recursion, the second by equivalence to a 1-bounded-recursive program, and the third by constant parallel complexity

[1]  Jeffrey D. Ullman,et al.  Parallel complexity of logical query programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[2]  Stavros S. Cosmadakis,et al.  Parallel evaluation of recursive rule queries , 1985, PODS '86.

[3]  Yehoshua Sagiv,et al.  Optimizing datalog programs , 1987, Foundations of Deductive Databases and Logic Programming..

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

[5]  Seymour Ginsburg,et al.  On the Decomposition of Datalog Program Mappings , 1990, Theor. Comput. Sci..

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

[7]  Jeffrey F. Naughton,et al.  Data independent recursion in deductive databases , 1985, J. Comput. Syst. Sci..

[8]  Moshe Y. Vardi.  Decidability and undecidability results for boundedness of linear recursive queries , 1988, PODS.

[9]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

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

[11]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[12]  Jeffrey F. Naughton,et al.  A decidable class of bounded recursions , 1987, PODS '87.

[13]  Guozhu Dong.  On the Composition and Decomposition of Datalog Program Mappings , 1988, ICDT.

[14]  A. Phillips.  The macmillan company. , 1970, Analytical chemistry.