We consider rational relations made of pairs
of finite words such that
is a subword of
. We show that such a selecting relation can be realized by a transducer such that the output label of each transition is a subword of its input label. We also show that it is decidable whether a given relation has this property.