Boolean conjunctive query containment is NP-complete in the sense of the NP core: it reduces to evaluation by the Chandra–Merlin theorem, evaluating the right query in the canonical database of the left one, and evaluation reduces to it, a database being a variable-free query. This is the containment half of Chandra and Merlin (1977).