A new data structure for representation of relational databases for application in the normalization process

Abstract

In this paper, a new data structure named relational tree is proposed for the representation of the relational database in computer memory. Relational database schema represented using relational tree(s) appears to be more promising for semiautomating the process of normalization in a very efficient manner, which is prime motive of this paper. This paper provides all the fundamental concepts required for the understanding of the representation of relational schema using relational tree so that efficient algorithms of various normal forms can be designed by using this representation. This automation will considerably reduce manual efforts and errors in the process of normalization in software industries. Space requirements also improved, compared to previously proposed approaches. It is expected that application of various normalization algorithms on this way of representation is very efficient since the relational tree can be easily manipulated.