{"title":"关系型数据库设计中消除规范化过程","authors":"T. Hussain, S. Shamail, M. Awais","doi":"10.1109/INMIC.2003.1416760","DOIUrl":null,"url":null,"abstract":"The relational database design approach requires the process of normalization in order to minimize data redundancy and update anomalies in the relational schema. Algorithms defined in normalization theory depend upon various dependencies namely functional, multivalued, join and inclusion dependencies that should be carefully defined for a database application. Identification of these dependencies and a minimal cover is a complex and time consuming task for almost all practical problems. This work discusses how the normalization process can be eliminated from the required steps of database design. It explores various constructs of entity relationship diagram (ERD) and their transformation to relational schema. This work elaborates how un-normalized relations are created during the entity relationship (ER) model to relational schema transformation. A set of rules is presented which if followed at the stage of conceptual modeling would always generate a relational schema that satisfies normal forms up to Boyce-Codd normal form (BCNF), thus eliminating the need for normalization. The motivation behind this paper is to save the database designer's valuable time and effort otherwise required in defining dependencies, in finding a minimal cover and in normalizing a given relational schema.","PeriodicalId":253329,"journal":{"name":"7th International Multi Topic Conference, 2003. INMIC 2003.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Eliminating process of normalization in relational database design\",\"authors\":\"T. Hussain, S. Shamail, M. Awais\",\"doi\":\"10.1109/INMIC.2003.1416760\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The relational database design approach requires the process of normalization in order to minimize data redundancy and update anomalies in the relational schema. Algorithms defined in normalization theory depend upon various dependencies namely functional, multivalued, join and inclusion dependencies that should be carefully defined for a database application. Identification of these dependencies and a minimal cover is a complex and time consuming task for almost all practical problems. This work discusses how the normalization process can be eliminated from the required steps of database design. It explores various constructs of entity relationship diagram (ERD) and their transformation to relational schema. This work elaborates how un-normalized relations are created during the entity relationship (ER) model to relational schema transformation. A set of rules is presented which if followed at the stage of conceptual modeling would always generate a relational schema that satisfies normal forms up to Boyce-Codd normal form (BCNF), thus eliminating the need for normalization. The motivation behind this paper is to save the database designer's valuable time and effort otherwise required in defining dependencies, in finding a minimal cover and in normalizing a given relational schema.\",\"PeriodicalId\":253329,\"journal\":{\"name\":\"7th International Multi Topic Conference, 2003. INMIC 2003.\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-12-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"7th International Multi Topic Conference, 2003. INMIC 2003.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INMIC.2003.1416760\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"7th International Multi Topic Conference, 2003. INMIC 2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INMIC.2003.1416760","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Eliminating process of normalization in relational database design
The relational database design approach requires the process of normalization in order to minimize data redundancy and update anomalies in the relational schema. Algorithms defined in normalization theory depend upon various dependencies namely functional, multivalued, join and inclusion dependencies that should be carefully defined for a database application. Identification of these dependencies and a minimal cover is a complex and time consuming task for almost all practical problems. This work discusses how the normalization process can be eliminated from the required steps of database design. It explores various constructs of entity relationship diagram (ERD) and their transformation to relational schema. This work elaborates how un-normalized relations are created during the entity relationship (ER) model to relational schema transformation. A set of rules is presented which if followed at the stage of conceptual modeling would always generate a relational schema that satisfies normal forms up to Boyce-Codd normal form (BCNF), thus eliminating the need for normalization. The motivation behind this paper is to save the database designer's valuable time and effort otherwise required in defining dependencies, in finding a minimal cover and in normalizing a given relational schema.