Dynamic G-based fourth normal form in relational database

Author

Seyed-Abbassi, Behrooz K. ; Thompson, John C.

Author_Institution

Dept. of Comput. & Inf. Sci., North Florida Univ., Jacksonville, FL, USA

fYear

1989

fDate

9-12 Apr 1989

Firstpage

1326

Abstract

Dynamic G-based fourth normal form is a grammar-based verification method which utilizes Wijngaarden grammars (A. Van Wijngaarden, 1969), to test dynamic semantics of the fourth normal form in a relational database. Grammar formalizes the relational table at both attribute level and tuple level. It is useful in dynamic G-based fourth normal form to think of attributes and their relationships as forming a program and the tuples as forming the data upon which the program operates. Class LR(1) parsers can be designed to parse the resulting grammar. Using such a model could eliminate human interaction for syntactic and semantic interpretations of fourth normal form in a relational database

Keywords

database theory; grammars; program verification; relational databases; LR1 parsers; W-grammars; Wijngaarden grammars; attribute level; dynamic G-based fourth normal form; dynamic semantics; grammar-based verification method; human interaction; relational database; relational table; semantic interpretations; tuple level; Colon; Computer languages; Dynamic programming; Relational databases; Testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Southeastcon '89. Proceedings. Energy and Information Technologies in the Southeast., IEEE

Conference_Location

Columbia, SC

Type

conf

DOI

10.1109/SECON.1989.132637

Filename

132637