This paper deals with the querying of possibilistic relational databases, by means of generalized yes/no queries whose form is: "to what extent is it possible and certain that the answer to Q satisfies property P". Here, we consider cardinality-based generalized yes/no queries (in this case, property P is about cardinality) for which a processing technique is proposed, which avoids computing all the worlds attached to the possibilistic database.