This article is cited in 2 papers

Referential integrity of data in corporate information systems

V. S. Zykin

Omsk State Technical University, 11 Mira Av., Omsk 644050, Russian Federation

Abstract: The paper deals with the task of construction of a nonredundant set of referential constraints on data. This set of constraints allows regulating the business rules of using information on the enterprise, which is supported by a database management system and is located in a relation database. The inclusion dependences are the theoretical bases of the restrictions and they have obtained generalization in this paper; so, it is possible to use null values. This generalization is a consequence of their practical significance. The term “acyclic database schemes” is introduced and investigated for correct solution of this problem. Some attention is given to interpretation of acyclic schemas with hypergraphs, the theorem of acyclic hypergraph is proved. It is proposed to construct the set of all referential constraints automatically by using the rule of decomposition of relations. An algorithm of removing redundant referential integrity constraints is presented.

Keywords: referential integrity; undefined values; acyclic schemes.

Received: 05.01.2015

DOI: 10.14357/19922264150310

Bibliographic databases:

•