We investigate the partial orderings of the form P(X),⊂〉,where X is a relational structure and P(X) the set of the domains of itsisomorphic substructures. A rough classification of countable binary structurescorresponding to the forcing-related properties of the posets of their copies isobtained.