Polynomial time algorithm - first order query, Mathematics

Assignment Help:

For queries Q1 and Q2, we say Q1 is contained in Q2, denoted Q1 ⊆ Q2, iff Q1 (D) ⊆ Q2(D) for every database D.

  • The container problem for a fixed Query Q0 is the following decision problem: Given a query Q, decide whether Q0 ⊆ Q.
  • The containee problem for a fixed query Q0 is the following decision problem: Given a query Q, decide whether Q ⊆ Q0.

Formally prove or disprove the following statements:

(a) For every conjunctive query Q0, there is a polynomial-time algorithm to decide the container problem for Q0 and for given conjunctive queries Q.

(b) For every conjunctive query Q0, there is a polynomial-time algorithm to decide the container problem for Q0 and for given conjunctive queries Q that can be obtained from Q0 by adding some atoms.

(c) For every conjunctive query Q0, there is a polynomial-time algorithm to decide the containee problem for Q0 and for given conjunctive queries Q.

(d) For every first-order Query Q0, there is an algorithm to decide the containee problem for Q0 and for given first-order queries Q. To prove a statement, sketch an algorithm, along with an argument why it is polynomial, if possible. To disprove it, provide an M-hardness or undecidability proof.


Related Discussions:- Polynomial time algorithm - first order query

What is the length of one side of the square, The area of a square is 64 cm...

The area of a square is 64 cm 2 . What is the length of one side of the square? To find out the area of a square, you multiply the length of a side through itself, because all

Mod(z-25i)<15, Mod(Z-25i)   Sol) mod (Z-25i) means Z lies in the circumfer...

Mod(Z-25i)   Sol) mod (Z-25i) means Z lies in the circumference of the circle with (0,25) at its centre and radius less then 15. so difference in the max and min value of arg Z is

Geometyr, Lines EF and GH are graphed on this coordinate plane. Which point...

Lines EF and GH are graphed on this coordinate plane. Which point is the intersection of lines EF and GH?

Prove complement of element in boolean algebra is unique, Prove that, the c...

Prove that, the complement of each element in a Boolean algebra B is unique.     Ans:  Proof: Let I and 0 are the unit and zero elements of B correspondingly. Suppose b and c b

Find distance between points (b + c, Find the distance between the points (...

Find the distance between the points (b + c, c + a) and (c + a, a + b) . Ans : Use distance formula

Demerits and merit-the mode, The mode Merits i.  This can be dete...

The mode Merits i.  This can be determined from incomplete data given the observations along with the highest frequency are already known ii.  The mode has some applic

Minimum value of the function, How the property AM>or = GM used to get min...

How the property AM>or = GM used to get minimum value of the function......e,g for what condition of a and b does minimum value of a tan^2 x + b cot^2 x equals maximum value of a

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd