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

Euilibrium, What is partial market equilibrium

What is partial market equilibrium

Rectilinear figures, what are rctilinear figures ? types of rectilinear fig...

what are rctilinear figures ? types of rectilinear figures and their propertiees.

Determine the mean of the subsequent numbers, Determine the mean of the sub...

Determine the mean of the subsequent numbers: Example: Determine the mean of the subsequent numbers: 5, 7, 1, 3, 4 Solution: where x'          =

Prove that sec2+cosec2 can never be less than 2, Prove that sec 2 θ+cosec 2...

Prove that sec 2 θ+cosec 2 θ can never be less than 2. Ans:    S.T Sec 2 θ + Cosec 2 θ can never be less than 2. If possible let it be less than 2. 1 + Tan 2 θ + 1 + Cot

Greens function, construct the green''s function that satisfies dG''''-(2x+...

construct the green''s function that satisfies dG''''-(2x+1)G''+(x+1)G=delta(x-s), G(0,s)=G(1,s)=0

Calculate the average return, A department store faces a decision for a sea...

A department store faces a decision for a seasonal product for which demand can be high, medium or low. The purchaser can order 1, 2 or 3 lots of this product before the season beg

Devision, how many times can u put 10000 into 999999

how many times can u put 10000 into 999999

12, Ask question #Minimum 100 words accepted linear algebra

Ask question #Minimum 100 words accepted linear algebra

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