G-base fourth normal form in relational database

Authors:
B. K. Seyed-Abbassi;J. C. Thompson
Affiliations:
Division of Computer amd Information Sciences, University of North Florida, Jacksonville, FL;Electrical Engineering and Computer Sciences, University of Oklahoma, Norman, OK
Venue:
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Year:
1989

Citing 8
Cited 0

An introduction to database systems: vol. I (4th ed.)

An introduction to database systems: vol. I (4th ed.)
Computational problems related to the design of normal form relational schemas

ACM Transactions on Database Systems (TODS)
On the menbership problem for functional and multivalued dependencies in relational databases

ACM Transactions on Database Systems (TODS)
Principles of Database Systems

Principles of Database Systems
The Theory of Parsing, Translation, and Compiling

The Theory of Parsing, Translation, and Compiling
Normal forms and relational database operators

SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Grammatical relational database model (w-grammar parser)

Grammatical relational database model (w-grammar parser)
Theory of Relational Databases

Theory of Relational Databases

Quantified Score

Hi-index	0.00

Visualization

Abstract

G-base Fourth Normal Form is a Grammar based method used to formulate static and dynamic Fourth Normal Forms as a set of Wijngaarden grammars (W-Grammars) in relational database. Static W-grammar models static semantics (attribute level) which are considered to be time independent. Dynamic W-Grammars represent not only the interconnection in attribute level, but also consider the tuples of the relation and the relation of the components of the tuples to one another. The most important result is construction of parsers which are essentially of the class LR(1) for these grammars and thus verification can be done efficiently. Using such systems, a database administrator or a user could test the correctness of a proposed schema without the necessity of possessing a deep knowledge of database theory.