Consider the datalog program P defined as follows: par (X,Z), par(Z,Y). par (X,Z), par(Z,W), par(W,Y). r(X,Y)...

Transcribed Image Text:

Consider the datalog program P defined as follows: par (X,Z), par(Z,Y). par (X,Z), par(Z,W), par(W,Y). r(X,Y) :- s (X,Y) :- (a). Given the facts r(0,1) and s (1,2), determine all possible tuples derived in "par", and justify your answer. (b). Express P in (1) Relational Algebra and in (2) Domain Relational Calculus (DRC) languages. Consider the datalog program P defined as follows: par (X,Z), par(Z,Y). par (X,Z), par(Z,W), par(W,Y). r(X,Y) :- s (X,Y) :- (a). Given the facts r(0,1) and s (1,2), determine all possible tuples derived in "par", and justify your answer. (b). Express P in (1) Relational Algebra and in (2) Domain Relational Calculus (DRC) languages.