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 probability shane rolls a 5, Shane rolls a die numbered 1 by 6....

Shane rolls a die numbered 1 by 6. What is the probability Shane rolls a 5? From 2:15 P.M. to 4:15 P.M. is 2 hours. After that, from 4:15 P.M. to 4:45 P.M. is another half hour

Complex number, a ,b,c are complex numbers such that a/1-b=b/1-c=c-1-a=k.fi...

a ,b,c are complex numbers such that a/1-b=b/1-c=c-1-a=k.find the value of k

Calculate how much ribbon is needed to wrap the box, Ribbon is wrapped arou...

Ribbon is wrapped around a rectangular box that is 10 by 8 by 4 in. Using the example provided, calculate how much ribbon is needed to wrap the box. consider the amount of ribbon d

PROBABILITY, Find the probability of drawing a diamond card in each of the ...

Find the probability of drawing a diamond card in each of the consecutive draws from a well shuffled pack of cards,if the card drawn is not replaced after the first draw.

Algebra, how do i sole linear epuation

how do i sole linear epuation

Example of log rules, Example of Log Rules: Y = ½ gt 2 where g = 32 ...

Example of Log Rules: Y = ½ gt 2 where g = 32 Solution: y = 16 t 2 Find y for t = 10 using logs. log y = log 10     (16 t 2 ) log 10 y = log 10 16 + log 10

The formal algorithm in maths, When do you think you should introduce word ...

When do you think you should introduce word problems-before children master the formal algorithm, or after? What are your reasons for your choice? In any case, no textbook can s

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