Using- Views-to- Implement- Datalog- Programs培训课件.pptVIP

,, ,, ,, ,, ,, ,, Using Views to Implement Datalog Programs Inverse Rules Duschka’s Algorithm Inverting Rules Idea: “invert” the view definitions to give the global predicates definitions in terms of views and function symbols. Plug the globals’ definitions into the body of the query to get a direct expansion of the query into views. Even works when the query is a program. Inverting Rules --- (2) But the query may have function symbols in its solution, and these symbols actually have no meaning. We therefore need to get rid of them. Trick comes from Huyn - Qian - Duschka. Skolem Functions Logical trick for getting rid of existentially quantified variables. In terms of safe Datalog rules: For each local (nondistinguished) variable X, pick a new function symbol f (the Skolem constant). Replace X by f (head variables). Example v(X,Y) :- p(X,Z) p(Z,Y) Replace Z by f(X,Y) to get: v(X,Y) :- p(X,f(X,Y)) p(f(X,Y),Y) Intuition: for v(X,Y) to be true, there must be some value, depending on X and Y, that makes the above body true. HQD Rule Inversion Replace a Skolemized view definition by rules with: A subgoal as the head, and The view itself as the only subgoal of the body. Example v(X,Y) :- p(X,f(X,Y)) p(f(X,Y),Y) becomes: p(X,f(X,Y)) :- v(X,Y) p(f(X,Y),Y) :- v(X,Y) Running Example: Maternal Ancestors Global predicates: m(X,Y) = “Y is the mother of X.” f(X,Y) = “Y is the father of X.” manc rules: r1: manc(X,Y) :- m(X,Y) r2: manc(X,Y) :- f(X,Z) manc(Z,Y) r3: manc(X,Y) :- m(X,Z) manc(Z,Y) Example --- Continued The views: v1(X,Y) :- f(X,Z) m(Z,Y) v2(X,Y) :- m(X,Y) Inverse rules: r4: f(X,g(X,Y)) :- v1(X,Y) r5: m(g(X,Y),Y) :- v1(X,Y) r6: m(X,Y) :- v2(X,Y) Evaluating the Rules Treat views as EDB. Apply semina?ve evaluation to query (Datalog program). In general, function symbols - no convergence. Evaluating the Rules But here, all function symbols are in the heads of global predicates. These are like EDB as far as the query is concerned, so no nested function