WGU 468
Latest uploads at WGU 468. Looking for notes at WGU 468? We have lots of notes, study guides and study notes available for your school.
-
196
- 0
-
12
All courses for WGU 468
-
WGU 468 1
-
WGU 468 196
Latest content WGU 468
An alias is especially useful when a table must be joined to itself in a(n) ___________________ 
query. - recursive 
The ___________ condition is generally composed of an equality comparison between the foreign 
key and the primary key of related tables. - join 
A database language enables the user to create database and table structures to perform basic data 
management chores. - TRUE 
______________________ is the process the DBMS uses to verify that only registered users access 
the database....
- Exam (elaborations)
- • 9 pages's •
-
WGU 468•WGU 468
Preview 2 out of 9 pages
Getting your document ready...
An alias is especially useful when a table must be joined to itself in a(n) ___________________ 
query. - recursive 
The ___________ condition is generally composed of an equality comparison between the foreign 
key and the primary key of related tables. - join 
A database language enables the user to create database and table structures to perform basic data 
management chores. - TRUE 
______________________ is the process the DBMS uses to verify that only registered users access 
the database....
AREA - In DB2, a named section of permanent storage space that is reserved to store the 
database. 
associative entity - See composite entity. 
bridge entity - See composite entity. 
candidate key - A minimal superkey; that is, a key that does not contain a subset of attributes 
that is itself a superkey. See key. 
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 enti...
- Exam (elaborations)
- • 5 pages's •
-
WGU 468•WGU 468
Preview 2 out of 5 pages
Getting your document ready...
AREA - In DB2, a named section of permanent storage space that is reserved to store the 
database. 
associative entity - See composite entity. 
bridge entity - See composite entity. 
candidate key - A minimal superkey; that is, a key that does not contain a subset of attributes 
that is itself a superkey. See key. 
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 enti...
binary relationship -An ER term for an association (relationship) between two entities. For 
example, PROFESSOR teaches CLASS. 
cardinality -An attribute that can be further subdivided to yield additional attributes. For 
example, a phone number such as may be divided into an area code (615), an 
exchange number (898), and a four-digit code (2368). Compare to simple attribute. 
composite identifier -In ER modeling, a key composed of more than one attribute. 
derived attribute -An attribute that...
- Exam (elaborations)
- • 3 pages's •
-
WGU 468•WGU 468
Preview 1 out of 3 pages
Getting your document ready...
binary relationship -An ER term for an association (relationship) between two entities. For 
example, PROFESSOR teaches CLASS. 
cardinality -An attribute that can be further subdivided to yield additional attributes. For 
example, a phone number such as may be divided into an area code (615), an 
exchange number (898), and a four-digit code (2368). Compare to simple attribute. 
composite identifier -In ER modeling, a key composed of more than one attribute. 
derived attribute -An attribute that...
access plan - A set of instructions generated at application compilation time that is created and 
managed by a DBMS. The access plan predetermines how an application's query will access the 
database at run time. 
algorithms - A process or set of operations in a calculation. 
automatic query optimization - A method by which a DBMS finds the most efficient access path 
for the execution of a query. 
B-tree index - An ordered data structure organized as an upside-down tree. 
bitmap index - An in...
- Exam (elaborations)
- • 3 pages's •
-
WGU 468•WGU 468
Preview 1 out of 3 pages
Getting your document ready...
access plan - A set of instructions generated at application compilation time that is created and 
managed by a DBMS. The access plan predetermines how an application's query will access the 
database at run time. 
algorithms - A process or set of operations in a calculation. 
automatic query optimization - A method by which a DBMS finds the most efficient access path 
for the execution of a query. 
B-tree index - An ordered data structure organized as an upside-down tree. 
bitmap index - An in...
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 
...
- Exam (elaborations)
- • 5 pages's •
-
WGU 468•WGU 468
Preview 2 out of 5 pages
Getting your document ready...
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 
...
domain - In data modeling, the construct used to organize and describe an attribute's set of 
possible values 
superkey - An attribute or attributes that uniquely identify each entity in a table. Any composite 
key with this is also this. 
candidate key - A minimal superkey; that is, a key that does not contain a subset of attributes 
that is itself a superkey 
entity integrity - The property of a relational table that guarantees each entity has a unique value 
in a primary key and that the key...
- Exam (elaborations)
- • 6 pages's •
-
WGU 468•WGU 468
Preview 2 out of 6 pages
Getting your document ready...
domain - In data modeling, the construct used to organize and describe an attribute's set of 
possible values 
superkey - An attribute or attributes that uniquely identify each entity in a table. Any composite 
key with this is also this. 
candidate key - A minimal superkey; that is, a key that does not contain a subset of attributes 
that is itself a superkey 
entity integrity - The property of a relational table that guarantees each entity has a unique value 
in a primary key and that the key...
Unary relationships are common in manufacturing industries. - TRUE 
_________________ not only helps database designers to stay on track during the design process, it 
also enables them to pick up the design thread when the time comes to modify the design. - 
Documentation 
Ideally, an entity identifier is composed of _____ attribute(s). - one 
The first step in building an entity-relationship diagram (ERD) is 
___________________________________________________________. - creating a detailed 
n...
- Exam (elaborations)
- • 6 pages's •
-
WGU 468•WGU 468
Preview 2 out of 6 pages
Getting your document ready...
Unary relationships are common in manufacturing industries. - TRUE 
_________________ not only helps database designers to stay on track during the design process, it 
also enables them to pick up the design thread when the time comes to modify the design. - 
Documentation 
Ideally, an entity identifier is composed of _____ attribute(s). - one 
The first step in building an entity-relationship diagram (ERD) is 
___________________________________________________________. - creating a detailed 
n...
A salesperson is authorized to sell many products and a product can be sold by many salespersons. 
Which kind of binary relationship does this scenario describe? - Many-to-many 
Which two examples are attributes? - An employee number; A meeting code 
Which delete rule sets column values in a child table to a missing value when the matching data is 
deleted from the parent table? - Set-to-null 
Refer to the given SQL statement. 
CREATE TABLE member 
( 
member_id INT UNSIGNED NOT NULL AUTO_INCREME...
- Exam (elaborations)
- • 10 pages's •
-
WGU 468•WGU 468
Preview 2 out of 10 pages
Getting your document ready...
A salesperson is authorized to sell many products and a product can be sold by many salespersons. 
Which kind of binary relationship does this scenario describe? - Many-to-many 
Which two examples are attributes? - An employee number; A meeting code 
Which delete rule sets column values in a child table to a missing value when the matching data is 
deleted from the parent table? - Set-to-null 
Refer to the given SQL statement. 
CREATE TABLE member 
( 
member_id INT UNSIGNED NOT NULL AUTO_INCREME...
Associative Entity - All relationships for the (...) entity should be many. 
Attribute - An (...) is a property or characteristic of an entity. 
Binary relationship - A (...) is a relationship between two entity types. 
Cardinality - (...) represents the maximum number of entities that can be involved in a particular 
relationship. 
Cascade Delete - Will delete all records that reference the primary key 
Database - A (...) is a collection of information that is organized so that it can easily be...
- Exam (elaborations)
- • 7 pages's •
-
WGU 468•WGU 468
Preview 2 out of 7 pages
Getting your document ready...
Associative Entity - All relationships for the (...) entity should be many. 
Attribute - An (...) is a property or characteristic of an entity. 
Binary relationship - A (...) is a relationship between two entity types. 
Cardinality - (...) represents the maximum number of entities that can be involved in a particular 
relationship. 
Cascade Delete - Will delete all records that reference the primary key 
Database - A (...) is a collection of information that is organized so that it can easily be...
An inequality condition is also known as a natural join and an equality condition is also called a theta 
join. - False 
When using a(n) _____ join, only rows that meet the given criteria are returned. - inner 
The statement SELECT * FROM T1, T2 produces a(n) _____ join. - cross 
A(n) _____ join will select only the rows with matching values in the common attribute(s). - 
natural 
If a designer wishes to create an inner join, but the two tables do not have a commonly named 
attribute, he can use...
- Exam (elaborations)
- • 5 pages's •
-
WGU 468•WGU 468
Preview 2 out of 5 pages
Getting your document ready...
An inequality condition is also known as a natural join and an equality condition is also called a theta 
join. - False 
When using a(n) _____ join, only rows that meet the given criteria are returned. - inner 
The statement SELECT * FROM T1, T2 produces a(n) _____ join. - cross 
A(n) _____ join will select only the rows with matching values in the common attribute(s). - 
natural 
If a designer wishes to create an inner join, but the two tables do not have a commonly named 
attribute, he can use...