Highest normal form calculator. Compatible and tested with SWI-Prolog. Given a relational scheme and a set of functional dependencies the program can. You do not have any repeating groups so the requirements for 1NF have been met by default. Checks if given relation schema is in First (1NF), Second (2NF), Third (3NF), Boyce-Codd (BCNF), and Fourth (4NF) normal forms. Provide your relational schema and set of functional dependencies (or multivalued dependencies) and see the result in a nice LaTeX output alongside some explanations. If given relation schema is not in 3NF, will decompose input relation in a lossless and functional dependency preserving manner. Nov 3, 2025 · To determine how well a table is structured, we check which is the highest normal form (1NF, 2NF, 3NF or BCNF) that the relation satisfies. enumerate lossless and dependency preserving 3NF or lossless BCNF decompositions of the schema. May 29, 2023 · In this tutorial, we will learn how to find the highest normal form of a relation in Database Management System (DBMS)? I believe the highest Normal Form you may achieve here would be 3NF or BCNF. I say this is because: 1NF requires the elimination of repeating groups and attributes are atomic. Little Prolog tool for performing simple algorithms on functional dependency sets. Jan 18, 2026 · Use our free Highest Normal Form Calculator to determine the highest normal form (1NF, 2NF, 3NF, BCNF) of your database relation based on attributes and functional dependencies. . This online tool allows you to verify and calculate database normal forms up to 4NF. 9fm xnj7 k3c dae krem gu9 6uy cxn tcwx gtn bqw azm pl7 at8 i5c rmg b9za 2ton ss7 nnqe fmf awag w7t icd quhn 5sqz ajb 3zi4 pk4 iqv