The **data** complexity bound in Theorem 5 is tight even for inclusion dependencies. The proof, proceeds by showing that a "universal machine" for alternating PSpace can be constructed by fixing appropriate Q, C, S in a PQI problem.