Which of these describe an INDEXED FILE ORGANIZATION? (There can be more than one answer) [mark...

Transcribed Image Text:

Which of these describe an INDEXED FILE ORGANIZATION? (There can be more than one answer) [mark all correct answers] a. Referencing storage space, this method has no wasted space. b. Referencing sequential retrieval on the primary key, this method is impractical. c. Referencing multiple key retrieval, this method is not possible. d. Referencing updating rows, this method is easy but requires maintenance of indexes. e. Referencing random retrieval on primary key, this method is moderately fast. Value: 1 Which of these describe a HASHED FILE ORGANIZATION? (There may be more than one answer.) [mark all correct answers] a. Referencing storage space, this method has no wasted space. b. Referencing sequential retrieval on the primary key, this method is impractical. c. Referencing multiple key retrieval, this method is not possible. d. Referencing updating rows, this method is easy but requires maintenance of indexes. e. Referencing random retrieval on primary key, this method is moderately fast. Value: 1 Which of these DO NOT describe a SEQUENTIAL FILE ORGANIZATION? [mark all correct answers] a. Referencing storage space, this method has no wasted space. b. Referencing sequential retrieval on the primary key, this method is impractical. c. Referencing multiple key retrieval, this method is not possible. d. Referencing updating rows, this method is easy but requires maintenance of indexes. e. Referencing random retrieval on primary key, this method is moderately fast. Match the items. a. Ternary relationship b. Relationship c. Unary relationship d. Normalization e. Repeating group f. Third normal form (3NF) g. Associative entity h. Binary relationship 1. An entity type that associates the instances of one or more entity types and contains attributes that are peculiar to the relationship between those entity instances 2. A set of two or more multivalued attributes that are logically a related 3. An association between the instances of one or more entity a types that is of interest to the organization 4. A relationship between instances of two entity types 5. A simultaneous relationship among instances of three entity a types 6. A relationship between the instances of one entity type 7. A relation is in this form if it is in second normal form and no a transitive dependencies exist. 8. The process of converting complex data structures into simple, stable data structures a Match the items. a. Ternary relationship b. Relationship c. Unary relationship d. Normalization e. Repeating group f. Third normal form (3NF) g. Associative entity h. Binary relationship 1. An entity type that associates the instances of one or more entity types and contains attributes that are peculiar to the relationship between those entity instances 2. A set of two or more multivalued attributes that are logically a related 3. An association between the instances of one or more entity a types that is of interest to the organization 4. A relationship between instances of two entity types 5. A simultaneous relationship among instances of three entity a types 6. A relationship between the instances of one entity type 7. A relation is in this form if it is in second normal form and no a transitive dependencies exist. 8. The process of converting complex data structures into simple, stable data structures a Match the items. a. Well-structured relation b. Relation c. Second normal form (2NF) d. Functional dependency e. Foreign key f. Synonym g. Recursive foreign key h. Homonym i. Referential integrity j. Relational database model 1. A relation that contains a minimum amount of redundancy and allows users to insert, modify, and delete the rows in a table without errors or inconsistencies 2. A relation is in this form if every nonprimary key attribute is functionally dependent on the whole primary key. 3. A particular relationship between two attributes, for every valid instance of A, that value of A uniquely determines the value of B. 4. An attribute that appears as a nonprimary key attribute in one relation and as a primary key attribute (or part of a primary key) in another relation 5. A data model that represents data as a set of related tables or relations 6. A foreign key in a relation that references the primary key values of that same relation 7. Two different names that are used for the same attribute 8. A named two-dimensional table of data 9. An integrity constraint that specifies that the value (or existence) of an attribute in one relation depends on the value (or existence) of the same attribute in another relation 10. A single attribute name that is used for two or more different attributes a a a a Which of these describe an INDEXED FILE ORGANIZATION? (There can be more than one answer) [mark all correct answers] a. Referencing storage space, this method has no wasted space. b. Referencing sequential retrieval on the primary key, this method is impractical. c. Referencing multiple key retrieval, this method is not possible. d. Referencing updating rows, this method is easy but requires maintenance of indexes. e. Referencing random retrieval on primary key, this method is moderately fast. Value: 1 Which of these describe a HASHED FILE ORGANIZATION? (There may be more than one answer.) [mark all correct answers] a. Referencing storage space, this method has no wasted space. b. Referencing sequential retrieval on the primary key, this method is impractical. c. Referencing multiple key retrieval, this method is not possible. d. Referencing updating rows, this method is easy but requires maintenance of indexes. e. Referencing random retrieval on primary key, this method is moderately fast. Value: 1 Which of these DO NOT describe a SEQUENTIAL FILE ORGANIZATION? [mark all correct answers] a. Referencing storage space, this method has no wasted space. b. Referencing sequential retrieval on the primary key, this method is impractical. c. Referencing multiple key retrieval, this method is not possible. d. Referencing updating rows, this method is easy but requires maintenance of indexes. e. Referencing random retrieval on primary key, this method is moderately fast. Match the items. a. Ternary relationship b. Relationship c. Unary relationship d. Normalization e. Repeating group f. Third normal form (3NF) g. Associative entity h. Binary relationship 1. An entity type that associates the instances of one or more entity types and contains attributes that are peculiar to the relationship between those entity instances 2. A set of two or more multivalued attributes that are logically a related 3. An association between the instances of one or more entity a types that is of interest to the organization 4. A relationship between instances of two entity types 5. A simultaneous relationship among instances of three entity a types 6. A relationship between the instances of one entity type 7. A relation is in this form if it is in second normal form and no a transitive dependencies exist. 8. The process of converting complex data structures into simple, stable data structures a Match the items. a. Ternary relationship b. Relationship c. Unary relationship d. Normalization e. Repeating group f. Third normal form (3NF) g. Associative entity h. Binary relationship 1. An entity type that associates the instances of one or more entity types and contains attributes that are peculiar to the relationship between those entity instances 2. A set of two or more multivalued attributes that are logically a related 3. An association between the instances of one or more entity a types that is of interest to the organization 4. A relationship between instances of two entity types 5. A simultaneous relationship among instances of three entity a types 6. A relationship between the instances of one entity type 7. A relation is in this form if it is in second normal form and no a transitive dependencies exist. 8. The process of converting complex data structures into simple, stable data structures a Match the items. a. Well-structured relation b. Relation c. Second normal form (2NF) d. Functional dependency e. Foreign key f. Synonym g. Recursive foreign key h. Homonym i. Referential integrity j. Relational database model 1. A relation that contains a minimum amount of redundancy and allows users to insert, modify, and delete the rows in a table without errors or inconsistencies 2. A relation is in this form if every nonprimary key attribute is functionally dependent on the whole primary key. 3. A particular relationship between two attributes, for every valid instance of A, that value of A uniquely determines the value of B. 4. An attribute that appears as a nonprimary key attribute in one relation and as a primary key attribute (or part of a primary key) in another relation 5. A data model that represents data as a set of related tables or relations 6. A foreign key in a relation that references the primary key values of that same relation 7. Two different names that are used for the same attribute 8. A named two-dimensional table of data 9. An integrity constraint that specifies that the value (or existence) of an attribute in one relation depends on the value (or existence) of the same attribute in another relation 10. A single attribute name that is used for two or more different attributes a a a a