--%>

Containee problem

For queries Q1 and Q2, we say Q1 is containedin Q2, denoted Q1 C Q2, iff Q1(D) C Q2(D) for every database D.

The container problern for a fixed Query Qo is the following decision problem:
Given a query Q, decide whether Qo C Q.

The containee probletn for a fixed guery Qo is the following decision problem:
Given a query Q, decide whether Q C Qo.

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 Qo by adding some atoms.

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

(d) For every flrst-order Query Q0, there is an algorithm to decide the containee problem for Qo 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 Questions in Mathematics

  • Q : Problem on reduced row-echelon The

    The augmented matrix from a system of linear equations has the following reduced row-echelon form. 280_row echelon method.jpg

  • Q : State Measuring complexity Measuring

    Measuring complexity: Many algorithms have an integer n, or two integers m and n, as input - e.g., addition, multiplication, exponentiation, factorisation and primality testing. When we want to describe or analyse the `easiness' or `hardness' of the a

  • Q : Problem on budgeted cash collections

    XYZ Company collects 20% of a month's sales in the month of sale, 70% in the month following sale, and 5% in the second month following sale. The remainder is not collectible. Budgeted sales for the subsequent four months are:     

  • Q : Abstract Algebra let a, b, c, d be

    let a, b, c, d be integers. Prove the following statements: (a) if a|b and b|c. (b) if a|b and ac|bd. (c) if d|a and d|b then d|(xa+yb) for any x, y EZ

  • Q : Problem on Fermats method A public key

    A public key for RSA is published as n = 17947 and a = 3. (i) Use Fermat’s method to factor n. (ii) Check that this defines a valid system and find the private key X.

    Q : Who had find Monte Carlo and finite

    Who had find Monte Carlo and finite differences of the binomial model?

  • Q : Define Big-O notation Big-O notation :

    Big-O notation: If f(n) and g(n) are functions of a natural number n, we write f(n) is O(g(n)) and we say f is big-O of g if there is a constant C (independent of n) such that f

  • Q : Define Well-formed formulas or Wffs

    Wffs (Well-formed formulas): These are defined inductively by the following clauses:    (i) If  P  is an n-ary predicate and  t1, …, tn are terms, then P(t1, …, t

  • Q : Formulating linear program of a

    A software company has a new product specifically designed for the lumber industry. The VP of marketing has been given a budget of $1,35,00to market the product over the quarter. She has decided that $35,000 of the budget will be spent promoting the product at the nat

  • Q : The mean of the sampling distribution

    1. Caterer determines that 87% of people who sampled the food thought it was delicious. A random sample of 144 out of population of 5000 taken. The 144 are asked to sample the food. If P-hat is the proportion saying that the food is delicious, what is the mean of the sampling distribution p-hat?<