WGU C170 Data Management -
Applications
1NF - ANSNormal shape: No repeating companies, PK recognized, all values rely on PK
2NF - ANSNormal shape: 1NF and no partial dependencies
3NF - ANSNormal shape: 2NF and no transitive dependencies
4NF - ANSNormal shape: 3NF and no unbiased multivalued dependencies
access plan - ANSThe end result of parsing a SQL announcement; it consists of the
collection of steps a DBMS will use to execute the query and go back the end result set
within the maximum green way
ALL - ANSThis operator may be used to compare something to every back row of a
subquery
ANY - ANSThis operator may be used to examine something to a list of values and go back
any rows that fulfill the standards
automatic vs manual - ANSWhether query optimization is accomplished by the DBMS vs
achieved with the aid of the programmer
B-tree index - ANSAn ordered records shape organized as an upside-down tree
base desk - ANSThe table on which a view is based totally
batch update ordinary - ANSA ordinary that swimming pools transactions into a single
institution to update a master desk in a single operation
BCNF (Boyce-Codd Normal Form) - ANSNormal shape: each determinant is a candidate key
(unique case of 3NF)
bitmap index - ANSAn index that makes use of a chunk array (0s and 1s) to symbolize the
existence of a cost or circumstance
candidate key - ANSA minimum superkey; that is, a key that does not incorporate a subset
of attributes this is itself a superkey
cardinality - ANSTerm for what number of instances of one object are related to instances of
every other object (most)
Applications
1NF - ANSNormal shape: No repeating companies, PK recognized, all values rely on PK
2NF - ANSNormal shape: 1NF and no partial dependencies
3NF - ANSNormal shape: 2NF and no transitive dependencies
4NF - ANSNormal shape: 3NF and no unbiased multivalued dependencies
access plan - ANSThe end result of parsing a SQL announcement; it consists of the
collection of steps a DBMS will use to execute the query and go back the end result set
within the maximum green way
ALL - ANSThis operator may be used to compare something to every back row of a
subquery
ANY - ANSThis operator may be used to examine something to a list of values and go back
any rows that fulfill the standards
automatic vs manual - ANSWhether query optimization is accomplished by the DBMS vs
achieved with the aid of the programmer
B-tree index - ANSAn ordered records shape organized as an upside-down tree
base desk - ANSThe table on which a view is based totally
batch update ordinary - ANSA ordinary that swimming pools transactions into a single
institution to update a master desk in a single operation
BCNF (Boyce-Codd Normal Form) - ANSNormal shape: each determinant is a candidate key
(unique case of 3NF)
bitmap index - ANSAn index that makes use of a chunk array (0s and 1s) to symbolize the
existence of a cost or circumstance
candidate key - ANSA minimum superkey; that is, a key that does not incorporate a subset
of attributes this is itself a superkey
cardinality - ANSTerm for what number of instances of one object are related to instances of
every other object (most)
