Skip to the main content

Journal of computing and information technology, Vol. 1 No. 2, 1993.

Original scientific paper

A Syntactic Method for Enforcing Semantic Database Integrity Constraints

Robert R. Goldberg ; Department of Computer Science, Queens College of CUNY, Flushing, USA
Jacob Shapiro ; Department of Statistics and Computer Information Systems, Baruch College of CUNY, New York, USA
Jerry Waxman ; Department of Computer Science, Queens College of CUNY, Flushing, USA

Full text: english pdf 4.935 Kb

page 111-121

downloads: 145

cite

Abstract

An automata theoretic framework is proposed which allows for a syntactic treatment of semantic properties of relational databases.The semantic integrity of a database is defined in terms of predicates on its attributes. These predicates are shown to determine the specification of a finite state automata which detects, in time proportional to the length of the input, whether the semantic integrity of the database has been violated. In addition, this approach leads to efficient techniques for dealing with the problems of consistency, equivalence and redundancy of integrity constraints. These concepts are defined and algorithms for their determination are described.

Keywords

Hrčak ID:

150505

URI

https://hrcak.srce.hr/150505

Publication date:

30.6.1993.

Visits: 414 *