In some database applications it is natural to define individual attributes of a relation as derived attributes, separately from the definition of other attributes. This approach minimizes the complexity of the schema. We propose a formalism in which rules are divided into two classes: Defining rules" specify the existence of tuples in the relation, together with some of their attributes. "Refining rules" specify derived attributes of tuples that already exist according to the defining rules.
展开▼
