C170 wgu already passed - Study guides, Class notes & Summaries

An entity is said to be X -dependent if it can exist in the database only when it is associated with another related entity occurrence. - existence A table that has all key attributes defined has no repeating groups and all its attributes are dependent on the primary key is said to be in X. - 1nf A determinant is any attribute whose value determines other values within a column. - F X is a process that is used for changing attributes to entities. - Normalization Any attribute whose value d...

An entity is said to be X -dependent if it can exist in the database only when it is associated with another related entity occurrence. - existence A table that has all key attributes defined has no repeating groups and all its attributes are dependent on the primary key is said to be in X. - 1nf A determinant is any attribute whose value determines other values within a column. - F X is a process that is used for changing attributes to entities. - Normalization Any attribute whose value d...

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 ...

WGU c170 The Most Important SQL Commands (SQL study guide) Already Passed

WGU C170 Chapter 5 already passed 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...

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...

DML - IUDS, CR insert, update, delete, select commit, rollback INSERT - add new rows UPDATE - modify data of existing rows DELETE - delete some/all records from database can be rolled back COMMIT - permanently saves ROLLBACK - undo changes SELECT - data retrieval WHERE - limits rows returned used before group by ORDER BY - OC sorts columns

DML - IUDS, CR insert, update, delete, select commit, rollback INSERT - add new rows UPDATE - modify data of existing rows DELETE - delete some/all records from database can be rolled back COMMIT - permanently saves ROLLBACK - undo changes SELECT - data retrieval WHERE - limits rows returned used before group by ORDER BY - OC sorts columns

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 ...