Algorithm for Relational Database Normalization Up to 3NF

Demba, Moussa

doi:10.5121/ijdms.2013.5303

Cited by 22 publications

(12 citation statements)

References 6 publications

(5 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Cross Join produces a result set which includes number of tuple in the first relation multiplied by the number of tuple in the second relation, if there is no where clause is used with Cross Join syntax. This type of query results is called as Cartesian product [17]. If the where clause statement is used with Cross Join.…”

Section: Related Workmentioning

confidence: 99%

Determining Lowest Cost Communication Path in Distributed Database System

Pandey¹

2017

ijarcs

View full text Add to dashboard Cite

Relational Database is interpreted as collection of interrelated data or records, where Database Management System is software of synthesize programs used to manage overall problem arises in the Relational database system. Join Operation is used to combine more than one relation using single query statement. Sometimes, it is impossible to get result from a single relation of the relational database in their case join operation is useful to fetch data from more than one relation of the database. Join is a performed as Cartesian product followed by some specific condition process. In this paper we are going to proposed, an algorithm that reduce the communication cost when the join operation is performed on the distributed database query system. In distributed database system, join operation is performed on different sites of the communication network. This proposed algorithm is automatically selecting the lowest cost communication path to perform the join operation on relational database.

show abstract

Section: Related Workmentioning

confidence: 99%

Determining Lowest Cost Communication Path in Distributed Database System

Pandey¹

2017

ijarcs

View full text Add to dashboard Cite

show abstract

“…G.Sunitha, Dr.A.Jaya, "A KNOWLEDGE BASED APPROACH FOR AUTOMATIC DATABASE NORMALIZATION", [9] aims to provide automatic normalization of databases up to 3NF in order to reduce the time consuming in manually normalization. Moussa Demba, "ALGORITHM FOR RELATIONAL DATABASE NORMALIZATION UP TO 3NF", [2] the author proposed an algorithmic approach for database normalization up to third normal form by taking into account all candidate keys, including the primary key.…”

Section: Pb Alappanavar Dhiraj Patil Radhika Grover Srishtimentioning

confidence: 99%

“…It usually involves dividing a database into two or more tables and defining relationships between the tables. The objective is to isolate data so that additions, deletions, and modifications of a field can be made in just one table and then propagated through the rest of the database via the defined relationships [2].…”

Section: Introductionmentioning

confidence: 99%

Automating the Lower and Higher Normal Form Process for the Database Systems

Younis¹

2014

IJCA

View full text Add to dashboard Cite

Normalization is an important technique for the analysis of relational databases. It aims to create a set of relational tables with minimum data redundancy that preserve consistency and facilitate correct insertion, deletion, and modification. It is very much time consuming to do this data analysis manually. Thus in this paper, a system is proposed which aims to automate the most complex phase of the database design normalization. It will help to achieve a good database design and eliminate the drawbacks of manual normalization process. This system is suitable to eliminate redundancy and inconsistent dependency automatically. It aims to handle the normalization process up to fifth normal. This includes creating tables and establishing relationships between those tables by using their general definitions in a step-by-step feature on the set of functional dependencies to remove redundant data. Then this system is tested on many examples with multiple candidate keys taken from different sources.

show abstract

“…This strategy reduces memory and increases processing speed. Another proposal that allows users normalize up to 3NF considers all possible candidate keys . In a first stage, it eliminates functional dependencies and then normalizes relations using fields as input.…”

Section: Introductionmentioning

confidence: 99%

An educational software for teaching database normalization

Piza-Dávila

Gutierrez-Preciado

Ortega-Guzmán

2017

Comp Applic In Engineering

View full text Add to dashboard Cite

Database normalization is a key process for designing databases. However, it is one of the most complex topics for students in IT undergraduate programs. This work proposes a new software tool that supports students in the process of normalization. This learning tool allows the students to see step by step how to carry out each normal form up to the 3NF. This tool is based on data analysis of the input table as it is explained in class, and not on analyzing the scheme or initial dependencies defined by business rules. Thus, novel algorithms were developed to process the input table (user‐defined) as well as the tables created during the normalization process. The software was tested in two Database courses, obtaining an important increase in the performance of students who used the tool.

show abstract

Algorithm for Relational Database Normalization Up to 3NF

Abstract: ABSTRACT

Cited by 22 publications

References 6 publications

Determining Lowest Cost Communication Path in Distributed Database System

Determining Lowest Cost Communication Path in Distributed Database System

Automating the Lower and Higher Normal Form Process for the Database Systems

An educational software for teaching database normalization

Contact Info

Product

Resources

About