

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
CECS 323 FINAL STUDY GUIDE QUESTIONS
Typology: Exams
1 / 3
This page cannot be seen from the preview
Don't miss anything!


Union - Answers - includes members of either or both sets without duplicates Minus or Except - Answers - includes only those members of the set on the left side of the expression that are not contained in the set on the right side of the expression Intersect - Answers - includes members that are common to both sets Union All - Answers - works like UNION (includes members of either or both sets) except it keeps duplicate rows in the set Set Operations - Answers - operations that aggregate two or more result sets. In order to do this all tables must have to contain the same number of columns of the same type What does it mean for a transaction to be ACID? - Answers - for a transaction to be ACID, the execution of each transaction must maintain the relationship between the database state and the enterprise state Atomicity - Answers - transaction is either performed in its entirety or not performed at all Isolation - Answers - transaction should appear as though it is being executed separately from other transactions Consistency - Answers - transaction must take the database from one valid state to another Durability - Answers - changes applied to the database by a committed transaction must persist, even if the system fails before all changes reflected on the disk Serializable Schedule - Answers - actual execution sequence of two or more concurrent transactions where running transactions T1 and T2 is the same effect as either T1;T2 or T2;T1. subclass - Answers - when one or more attributes of a class are characteristics of only some individuals of that class, but not others subquery - Answers - Sometimes you don't have enough information available when you design a query to determine which rows you want. In this case you'll have to find the required information with a subquery
generalization - Answers - process of designing subclasses from the "bottom up"; a class or entity that represents a superset of other class types can also be called a generalization of the child types. specialization - Answers - the process of designing subclasses from "top down"; a class that represents a subset of another class type can also be called a specialization of its parent class aggregation - Answers - UML notation to indicate that a class type really represents a collection of individual components composition - Answers - stronger form of aggregation that indicates component instances cannot exist on their own without a parent specialization constraints - Answers - the subclass association line is labeled with one of these. One example is "incomplete". data integrity - Answers - one goal of database developers is to provide this, part of which means insuring that the value entered in each field of a table is consistent with its attribute domain validation rule - Answers - rule devised to separate good from bad data enumerated domains - Answers - attribute domains that may be specified by a well- defined, reasonably-sized set of constant values, just multi-valued attributes with a set domain recursive association - Answers - a type of association that connects a single class type (serving in one role) to itself (serving in another role) normalization - Answers - process of applying a set of rules to your database design, mostly to achieve minimum redundancy in the data second normal form - Answers - eliminates subkeys where the subkey is part of a composite primary key third normal form - Answers - eliminates subkeys where the subkey is not part of the primary key first normal form - Answers - eliminates multi-valued attributes and repeated attributes Boyce-Codd Normal Form (BCNF) - Answers - form of normalization that is only affected by relations with overlapping candidate keys Dr. E.F. Codd - Answers - scientist who developed the relational model database for IBM in the 1970's