Abstract
Algebraic methods of proving database constraints are proposed. The first method is based on the formulation of constraints in terms of inclusions of some binary relations associated with database. The relations are generated by indiscernibility relations by means of the operations of the algebra of binary relations. The second method is based on the matrix representation of constraints.
Get full access to this article
View all access options for this article.