WGU C170 DATA MANAGEMENT
APPLICATIONS GSA1 PREPARATION EXAM
◍ dynamic statistical generation mode.
Answer: In a DBMS, the capability to automatically evaluate and update the
database access statistics after each data access operation.
◍ homonym.
Answer: The use of the same name to label different attributes, much like
similar-sounding words with different meanings
◍ Automatic query optimization.
Answer: A method by which a DBMS finds the most efficient access path
for the execution of a query.
◍ A database that is packaged with a programming language. AKA:
In-Process Database (Database Architecture) - SQLite - SQL Server
Compact.
Answer: Embedded Databases
◍ natural join.
Answer: A relational operation that yields a new table composed of only the
rows with common values in their common attribute(s).
◍ What are the four major DBMS approaches?.
Answer: - Hierarchical- Network- Relational- Object-oriented
◍ Set theory.
Answer: A part of mathematical science that deals with sets, or groups of
things, and is used as the basis for data manipulation in the relational model.
,◍ superkey.
Answer: An attribute or attributes that uniquely identify each entity in a
table. See key.
◍ referential integrity.
Answer: A condition by which a dependent table's foreign key must have
either a null entry or a matching entry in the related table.
◍ index.
Answer: An ordered array of index key values and row ID values (pointers).
Indexes are generally used to speed up and facilitate data retrieval. Also
known as an index key.
◍ table space.
Answer: In a DBMS, a logical storage space used to group related data. Also
known as a file group.
◍ What is the key factor based on the need for linear scalability?.
Answer: Performance
◍ simple attribute.
Answer: An attribute that cannot be subdivided into meaningful
components. Compare to composite attribute.
◍ Database object that maps one or more tables to a single file..
Answer: Tablespace
◍ OR operator.
Answer: - It displays a record it either the first condition OR the second
condition is true.
◍ unary relationship.
Answer: An ER term used to describe an association within an entity. For
example, an EMPLOYEE might manage another EMPLOYEE.
◍ DISTINCT operator.
Answer: - It is used to eliminate duplicate rows in a query result.
,◍ regular entity.
Answer: See strong entity.
◍ JOIN.
Answer: In relational algebra, a type of operator used to yield rows from two
tables based on criteria. There are many types of joins, such as natural join,
theta join, equijoin, and outer join.
◍ LIKE.
Answer: In SQL, a comparison operator used to check whether an attribute's
text value matches a specified string pattern.
◍ single-valued attribute.
Answer: An attribute that can have only one value.
◍ optional participation.
Answer: In ER modeling, a condition in which one entity occurrence does
not require a corresponding entity occurrence in a particular relationship.
◍ Create a Table.
Answer: CREATE TABLE TableName (ColumnName1
DataType,ColumnName2 DataType,ColumnName3 DataType,...);
◍ relational algebra.
Answer: A set of mathematical principles that form the basis for
manipulating relational table contents; the eight main functions are
SELECT, PROJECT, JOIN, INTERSECT, UNION, DIFFERENCE,
PRODUCT, and DIVIDE.
◍ composite entity.
Answer: 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. See also linking table.
◍ data sparsity.
Answer: A column distribution of values or the number of different values a
, column can have.
◍ simple attribute.
Answer: An attribute that cannot be subdivided into meaningful
components. Compare to composite attribute.
◍ A group of related entities from a complex model..
Answer: Subject Area
◍ functional dependence.
Answer: Within a relation R, an attribute B is functionally dependent on an
attribute A if and only if a given value of attribute A determines exactly one
value of attribute B. The relationship "B is dependent on A" is equivalent to
"A determines B," and is written as A B.
◍ Block or group of blocks containing rows/index entries..
Answer: Bucket
◍ Composite key.
Answer: A multiple-attribute key.
◍ Existence-independent.
Answer: A property of an entity that can exist apart from one or more
related entities. Such a table must be created first when referencing an
existence-dependent table.
◍ MERGE operator.
Answer: Merges two data sets (slow)
◍ What are the reasons for using the Dimensional Model for Business
Intelligence?.
Answer: - Simplicity.- Lack of bias.- Extensibility.
◍ A high-level representation of data requirements, ignoring implementation
details..
Answer: Entity-Relationship Model
◍ unary relationship.
Answer: An ER term used to describe an association within an entity. For
APPLICATIONS GSA1 PREPARATION EXAM
◍ dynamic statistical generation mode.
Answer: In a DBMS, the capability to automatically evaluate and update the
database access statistics after each data access operation.
◍ homonym.
Answer: The use of the same name to label different attributes, much like
similar-sounding words with different meanings
◍ Automatic query optimization.
Answer: A method by which a DBMS finds the most efficient access path
for the execution of a query.
◍ A database that is packaged with a programming language. AKA:
In-Process Database (Database Architecture) - SQLite - SQL Server
Compact.
Answer: Embedded Databases
◍ natural join.
Answer: A relational operation that yields a new table composed of only the
rows with common values in their common attribute(s).
◍ What are the four major DBMS approaches?.
Answer: - Hierarchical- Network- Relational- Object-oriented
◍ Set theory.
Answer: A part of mathematical science that deals with sets, or groups of
things, and is used as the basis for data manipulation in the relational model.
,◍ superkey.
Answer: An attribute or attributes that uniquely identify each entity in a
table. See key.
◍ referential integrity.
Answer: A condition by which a dependent table's foreign key must have
either a null entry or a matching entry in the related table.
◍ index.
Answer: An ordered array of index key values and row ID values (pointers).
Indexes are generally used to speed up and facilitate data retrieval. Also
known as an index key.
◍ table space.
Answer: In a DBMS, a logical storage space used to group related data. Also
known as a file group.
◍ What is the key factor based on the need for linear scalability?.
Answer: Performance
◍ simple attribute.
Answer: An attribute that cannot be subdivided into meaningful
components. Compare to composite attribute.
◍ Database object that maps one or more tables to a single file..
Answer: Tablespace
◍ OR operator.
Answer: - It displays a record it either the first condition OR the second
condition is true.
◍ unary relationship.
Answer: An ER term used to describe an association within an entity. For
example, an EMPLOYEE might manage another EMPLOYEE.
◍ DISTINCT operator.
Answer: - It is used to eliminate duplicate rows in a query result.
,◍ regular entity.
Answer: See strong entity.
◍ JOIN.
Answer: In relational algebra, a type of operator used to yield rows from two
tables based on criteria. There are many types of joins, such as natural join,
theta join, equijoin, and outer join.
◍ LIKE.
Answer: In SQL, a comparison operator used to check whether an attribute's
text value matches a specified string pattern.
◍ single-valued attribute.
Answer: An attribute that can have only one value.
◍ optional participation.
Answer: In ER modeling, a condition in which one entity occurrence does
not require a corresponding entity occurrence in a particular relationship.
◍ Create a Table.
Answer: CREATE TABLE TableName (ColumnName1
DataType,ColumnName2 DataType,ColumnName3 DataType,...);
◍ relational algebra.
Answer: A set of mathematical principles that form the basis for
manipulating relational table contents; the eight main functions are
SELECT, PROJECT, JOIN, INTERSECT, UNION, DIFFERENCE,
PRODUCT, and DIVIDE.
◍ composite entity.
Answer: 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. See also linking table.
◍ data sparsity.
Answer: A column distribution of values or the number of different values a
, column can have.
◍ simple attribute.
Answer: An attribute that cannot be subdivided into meaningful
components. Compare to composite attribute.
◍ A group of related entities from a complex model..
Answer: Subject Area
◍ functional dependence.
Answer: Within a relation R, an attribute B is functionally dependent on an
attribute A if and only if a given value of attribute A determines exactly one
value of attribute B. The relationship "B is dependent on A" is equivalent to
"A determines B," and is written as A B.
◍ Block or group of blocks containing rows/index entries..
Answer: Bucket
◍ Composite key.
Answer: A multiple-attribute key.
◍ Existence-independent.
Answer: A property of an entity that can exist apart from one or more
related entities. Such a table must be created first when referencing an
existence-dependent table.
◍ MERGE operator.
Answer: Merges two data sets (slow)
◍ What are the reasons for using the Dimensional Model for Business
Intelligence?.
Answer: - Simplicity.- Lack of bias.- Extensibility.
◍ A high-level representation of data requirements, ignoring implementation
details..
Answer: Entity-Relationship Model
◍ unary relationship.
Answer: An ER term used to describe an association within an entity. For
