front 1 ____is the result of revealing the meaning of raw facts. | back 1 Information |
front 2 End_user data is____. | back 2 raw facts of interest to the end user |
front 3 ______provide a description of the data characteristics and the set of relationships that link the data found within the database. | back 3 Metadata |
front 4 ______exists when different versions of the same data appear in different places. | back 4 Data Incnsistency |
front 5 The response of the DBMS to a query is the _____. | back 5 Query result set. |
front 6 Data Warehouse contains historical data obtained from the______. | back 6 operational databases |
front 7 _____data exist in the format in which they were collected. | back 7 unstructured |
front 8 _______data exist in a format that does not lend itself to processing that yields information. | back 8 Unstructured |
front 9 ______is defined as the condition in which all the data in the database are consistent with the real-world events and conditions. | back 9 Data Integrity |
front 10 The term_____ refers to an organization of components that define and regulate the collection,storage, management and use of data within a database environment. | back 10 Database system. |
front 11 Business rules are derived from____. | back 11 A detailed description of an organization's operations |
front 12 A noun in a business rule translates to a(n)___ in the data model. | back 12 Entity |
front 13 A verb associating two nouns in a business rule translates to a(n)___in the data model. | back 13 Relationship. |
front 14 A(n)___ represents a particular type of object in the real world. | back 14 Entity |
front 15 The___model was developed to allow designers to use a graphical tool to examine structures rather than describing them with text. | back 15 entity relationship |
front 16 A(n)___ is anything about which data are to be collected and stored. | back 16 Entity |
front 17 A(n)___is the equivalent of a field in a file system. | back 17 attribute |
front 18 A(n)__ is bidirectional. | back 18 Relationship |
front 19 ____are important because they help to ensure data integrity. | back 19 Constraints |
front 20 Students and classes have a ____relationship. | back 20 Many-to-many |
front 21 The logical view of the relational database is facilitated by the creation of data relationships based on a logical construct knows as a(n)___. | back 21 Relation |
front 22 In a relational table, each column has a specific range of values knows as the ____domain | back 22 Attribute |
front 23 In the relational model,___are important because they are used to ensure that each row in a table is uniquely identifiable. | back 23 Keys |
front 24 Attribute A determines attribute B(that is, B is functionally _____ on A) if all of the rows in the table that agree in value for attribute A also agree in value for attribute B. | back 24 Dependent |
front 25 A(n)____key can be described as a superkey without unnecessary attributes. | back 25 candidate |
front 26 If the foreign key contains either matching values or nulls, the table that makes use of that foreign key is said to exhibit ___integrity. | back 26 referential |
front 27 To avoid nulls, some designers use special codes, known as____, to indicated the absence of some value. | back 27 Flags |
front 28 The relational operators have the property of ____; that is, the use of relational algebra operators on existing relations(tables)produce new relations. | back 28 Closure |
front 29 PRODUCT yields all possible pairs of rows from two tables--also known as the ____product. | back 29 Cartesian |
front 30 The___ is the real power behind the relational database, allowing the use of independent tables linked by common attributes | back 30 JOIN |
front 31 A(n)___links tables on the basis of an equality condition that compares specified columns of each table. | back 31 equijoin |
front 32 The___joins are especially useful when you are trying to determine what value(s) in related tables cause(s) referential problems. | back 32 Outer |
front 33 A(n)____provides a detailed description of all tables found with the user/designer-created database | back 33 data dictionary |
front 34 The___relationship is the relational database norm. | back 34 1:M |
front 35 If one department chair--a professor--can chair only one department and one department can hae only one department chair, the the entities PROFESSOR and DEPARTMENT exhibit a(n)___relationship. | back 35 1:1 |
front 36 The ___relationships can be implemented by creating a new entity in 1:M relationships with the original entities. | back 36 M:N |
front 37 The proper use of ___keys is crucial to controlling data redundacy | back 37 Foreign |
front 38 A(n)___is an orderly arrangement used to logically access rows in a table. | back 38 Index |
front 39 The index Key can have multiple attributes, this is call a(n)____index | back 39 composite |
front 40 Codd's rule of ____states that every value in a table is guaranteed to be accessible through a combination of table name, primary key value, and column name. | back 40 Guaranteed Access. |
front 41 The Chen model is especially useful to illustrate the database from a(n)___perspective. | back 41 Conceptual |
front 42 Successful database design is, first and foremost, based on ___requirements. | back 42 End-user. |
front 43 A derived attribute____. | back 43 need not be physically stored within the database. |
front 44 Cardinality expresses___ number of entity occurrences associated with one occurrence of the related entity | back 44 the specific. |
front 45 A____attribute can be further subdivided to yield additional attributes. | back 45 composite |
front 46 If an entity can exist apart from one or more related entities, it is said to be ___-independent | back 46 existence |
front 47 A___relationship exists when two entities are associated. | back 47 binary |
front 48 The set of possible values for an attribute is a ___. | back 48 domain |
front 49 What type of attribute cannot be created in a DBMS? | back 49 Multivalued |
front 50 A relationship name should be a(n)___. | back 50 verb |
front 51 From a Structural point of view, 2NF is better than this | back 51 1NF |
front 52 It produces a lower normal form | back 52 denormalization |
front 53 it cause data redundancies of data on every row entry | back 53 duplication |
front 54 Any attribute whose value determines other values within a row | back 54 determinant |
front 55 A process to help reduce the likelihood of data anomalies | back 55 normalization |
front 56 it derives its name from the face that a group of multiple entries of the same type can exist for any single key attribute occurrence. | back 56 repeating group |
front 57 Any attribute that is at least part of a key | back 57 prime attribute |
front 58 a diagram that depicts all dependencies found within a given table structure. | back 58 dependency diagram |
front 59 a dependency bases on only a part of a composite primary key. | back 59 partial dependency |
front 60 Refers to the level of detail represented by the values stored in a table's row. | back 60 granularity |
front 61 Relational models view the data as part of a table or collection of tables in which all key values must be idenified | back 61 True |
front 62 Repeating groups must be eliminated by making sure that each row defines a single entity | back 62 True |
front 63 Converting a database format to 1NF to 2NF is a complex process. | back 63 False |
front 64 A table is in 2NF if it is in 1NF and it includes no partial dependecies | back 64 True |
front 65 It is possible for a table in 2NF to exhibit transitive dependency, where one or more attributes may be functionally dependent on non-key attributes. | back 65 True |
front 66 Denormalization is a process for assigning attributes to entities | back 66 False |
front 67 Dependencies that are based on only a part of a composite primary key are called transitive dependencies | back 67 False |
front 68 Repeating groups must be eliminated by making sure that each column defines a single entity. | back 68 False |
front 69 All relational tables satisfy the 1NF requirements. | back 69 True |
front 70 Atomic attributes are attributes that can be further divided. | back 70 False |