Extended possibilistic truth values are a flexible means to model the linguistic (un)certainty about the truth value of a proposition. With respect to flexible database querying, they are suited to express the extent to which a database instance satisfies a query condition. Since a query can impose several conditions, aggregation is necessary. In this paper, three definitions of conjunctive aggregation operators for extended possibilistic truth values are presented and compared with each other on the basis of their capability to rank the possible alternatives in the result of a (flexible) database query.