💡 Words with a Similar Meaning to "Second normal form"
Found via reverse dictionary — words that share a conceptual meaning.
| Word | Definition |
|---|---|
| first normal formnoun | (databases) A stage in the normalization of a relational database in which repeating groups and attributes have been eliminated by putting each into a separate table connected by a primary-key/foreign-key relationship. |
| fifth normal formnoun | (databases) A stage in the normalization of a relational database in which a database is in fourth normal form and every join dependency is implied by the candidate keys. |
| fourth normal formnoun | (databases) A stage in the normalization of a relational database in which a database is in Boyce-Codd normal form and all multi-valued dependencies are functional dependencies. |
| boyce-codd normal formnoun | (databases) A stage in the normalization of a relational database in which a database is in third normal form and all determinants are candidate keys. |
| normal formnoun | (databases) Any of various forms of a relational database providing criteria for determining a table's degree of vulnerability to logical inconsistencies and anomalies. |
| partial dependencynoun | (computing) An attribute of a relation that depends on a key but also on a part of such key; this is a violation of second normal form. |
| canonical disjunctive normal formnoun | (logic) Disjunctive normal form with the additional property that all of the terms of the sum contain the same literals, so that the terms differ from each other only in their patterns of complementation (of their literals). |
| relational modelnoun | (databases) A database model that is based on first-order predicate logic. |
| backus normal formnoun | (obsolete) The Backus-Naur form. |
| trivial functional dependencynoun | (computing, database normalization) A functional dependency of an attribute on a superset of itself. |
| disjunctive normal formnoun | (logic) The form of a boolean formula that the formula has if the formula is a disjunction of conjunctions of literals, such as “(A and B and C) or (D and E and not F)”. |
| algebraic normal formnoun | (algebra, logic) ring sum normal form |
| conjunctive normal formnoun | (logic) The form of a Boolean formula that the formula has if the formula is a conjunction of disjunctions of literals, such as “(A or B or C) and (D or E or not F)”. |
| star schemanoun | (databases, data warehousing) A denormalized database schema consisting of one or more fact tables referencing any number of dimension tables. |
| natural keynoun | (databases) A unique key formed from attributes that relate to the external world being modelled, rather than being an internally generated surrogate key. |
| clausal normal formnoun | (logic) Synonym of conjunctive normal form. |
| prenex normal formnoun | (logic) A way of expressing a formula of predicate logic such the formula consists of a prenex and a matrix, with the prenex preceding the matrix. |
| data modelnoun | (databases) A database model, such as relational or hierarchical. |
| chomsky normal formnoun | (computing theory) A context-free grammar in which the right hand side of any production rule consists of either one terminal symbol or two non-terminal symbols (neither of which is the start symbol) or the epsilon (i.e. null string) symbol, but only if the left hand side is the start symbol. (Note: this is the full-fledged version, whereas the previous definition may be said to be defining Chomsky reduced form.) |
| superkeynoun | (databases) Any set of attributes of a relation variable (relvar) that serve to identify a single tuple or row, no other tuple having the same value for every attribute in the set. |
Translate “Second normal form” into Another Language
Pick a language — the word will be pre-filled in the translator.