WGU C170 Chp 1, With Complete Verified
Solution 2024.
AREA
in DB2, a named section of permanent storage space that is reserved to store the
database.
associative entity
another name for composite entity, bridge entity or linking table
bridge entity
another name for composite entity, associative entity or linking table
candidate key
a minimal superkey; that is, a key that dows not contain a subset of attributes that is
itself a superkey.
closure
A property of relational operators that permits the use of relational algebra operators on
existing tables (relations) to produce new relations.
composite entity
An entity designed to transform an M:N relationship into two 1:M relationships. The
composite entity's primary key comprises at least the primary keys of the entities that it
connects. Also known as a bridge entity or associative entity.
composite key
A multiple-attribute key.
dependent
an attribute whose value is determined by another attribute.
determination
The role of a key. In the context of a database table, the statement "A determines B"
indicates that knowing the value of attribute A means that the value of attribute B an be
looked up
DIFFERENCE
In relation algebra, an operator used to yield all rows from one table that are not found
in another union-compatible table.
DIVIDE
In relational algebra, an operator that answers queries about one set of data being
associated with all values of data in another set of data
domain
In data modeling, the construct used to organize and describe an attribute's set of
possible values.
entity integrity
The property of a relational table that guarantees each entity has a unique value in a
primary key and that the keys has no null values.
equijoin
A join operator that links tables based on an equality condition that compares specified
columns of the tables
flags
Solution 2024.
AREA
in DB2, a named section of permanent storage space that is reserved to store the
database.
associative entity
another name for composite entity, bridge entity or linking table
bridge entity
another name for composite entity, associative entity or linking table
candidate key
a minimal superkey; that is, a key that dows not contain a subset of attributes that is
itself a superkey.
closure
A property of relational operators that permits the use of relational algebra operators on
existing tables (relations) to produce new relations.
composite entity
An entity designed to transform an M:N relationship into two 1:M relationships. The
composite entity's primary key comprises at least the primary keys of the entities that it
connects. Also known as a bridge entity or associative entity.
composite key
A multiple-attribute key.
dependent
an attribute whose value is determined by another attribute.
determination
The role of a key. In the context of a database table, the statement "A determines B"
indicates that knowing the value of attribute A means that the value of attribute B an be
looked up
DIFFERENCE
In relation algebra, an operator used to yield all rows from one table that are not found
in another union-compatible table.
DIVIDE
In relational algebra, an operator that answers queries about one set of data being
associated with all values of data in another set of data
domain
In data modeling, the construct used to organize and describe an attribute's set of
possible values.
entity integrity
The property of a relational table that guarantees each entity has a unique value in a
primary key and that the keys has no null values.
equijoin
A join operator that links tables based on an equality condition that compares specified
columns of the tables
flags
