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
APA 6th Edition R. Goldberg, R., Shapiro, J. i Waxman, J. (1993). A Syntactic Method for Enforcing Semantic Database Integrity Constraints. Journal of computing and information technology, 1 (2), 111-121. Preuzeto s https://hrcak.srce.hr/150505
MLA 8th Edition R. Goldberg, Robert, et al. "A Syntactic Method for Enforcing Semantic Database Integrity Constraints." Journal of computing and information technology, vol. 1, br. 2, 1993, str. 111-121. https://hrcak.srce.hr/150505. Citirano 01.03.2021.
Chicago 17th Edition R. Goldberg, Robert, Jacob Shapiro i Jerry Waxman. "A Syntactic Method for Enforcing Semantic Database Integrity Constraints." Journal of computing and information technology 1, br. 2 (1993): 111-121. https://hrcak.srce.hr/150505
Harvard R. Goldberg, R., Shapiro, J., i Waxman, J. (1993). 'A Syntactic Method for Enforcing Semantic Database Integrity Constraints', Journal of computing and information technology, 1(2), str. 111-121. Preuzeto s: https://hrcak.srce.hr/150505 (Datum pristupa: 01.03.2021.)
Vancouver R. Goldberg R, Shapiro J, Waxman J. A Syntactic Method for Enforcing Semantic Database Integrity Constraints. Journal of computing and information technology [Internet]. 1993 [pristupljeno 01.03.2021.];1(2):111-121. Dostupno na: https://hrcak.srce.hr/150505
IEEE R. R. Goldberg, J. Shapiro i J. Waxman, "A Syntactic Method for Enforcing Semantic Database Integrity Constraints", Journal of computing and information technology, vol.1, br. 2, str. 111-121, 1993. [Online]. Dostupno na: https://hrcak.srce.hr/150505. [Citirano: 01.03.2021.]
Sažetak 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.