A mathematical model for data structures is presented from which
other weil known and widely used methods of representation can be derived easily.
In this model the schema/instance relationship which is especially important with
regard to data base systems, is described in terms of partitions, quotient structures,
and homomorphisms of data structures. The main result is an algebraic characterization
of the set of possible schemas for a given data structure.