Classification of a Path in an ER Schema by Using the Notions of Corresponding and Representing

After constructing an entity-relationship (E-R) schema, how to evaluate it seems to remain as an open problem. In this article the authors present the notion of ´classification of a path in a schema´ based upon conceptual and semantic analysis of a data modeling process, and a method for classifying a path by virtue of set theory. The authors also present detailed analysis of different classes of a path in a schema. These seem significant for solving some of problems regarding evaluating an ER schema, such as, whether there are any redundant paths, whether the schema is a minimal one and whether there are any connection traps in the schema