Help
Options
Didn't know it?
click below
click below
Knew it?
click below
click below
Don't Know
Remaining cards (0)
Know
retry
shuffle
restart
0:00
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.
Normal Size Small Size show me how
Normal Size Small Size show me how
Database Final
lol
| Question | Answer |
|---|---|
| Organizations that utilize the file processing approach spend as much as ________ of their IS development budget on maintenance. | 80 percent |
| ________ analyze the business situation and identify the need for information and information services to meet the problems or opportunities of the business. | Systems analysts |
| One application of data warehouses is: | decision support |
| A database is an organized collection of ________ related data. | logically |
| Program-data dependence is caused by: | file descriptors being stored in each application |
| E.F. Codd developed the relational model in the: | 1970s |
| A knowledge of database information infects about an enterprise is called a(n): | repository |
| A person, please, an object, an event or concept about which the organization wishes to maintain data is called a(n): | entity |
| All of the following are properties for metadata EXCEPT | processing logic |
| The most common source of database failures in organizations is: | failure to implement a strong database administration function |
| A workgroup database is stored on a central device called a(n): | server |
| Which of the following is NOT a cost and/or risk of the database approach? | Improved responsiveness |
| A(n) ________ is often developed by identifying a form or report that a user needs on a regular basis. | user view |
| Data processed in a way that increases a user's knowledge is: | information |
| Organizing the database in computer disk storage is done in the ________ phase. | design |
| One of the most popular RAD methods is: | prototyping |
| ________ is a tool even non-programmers | structured query language (SQL) |
| Relational databases establish the relationships between entities by means of common fields included in a file called a(n): | relation |
| The SDLC phase in which database processing programs are created is the ________ phase. | implementation |
| In a file processing environment, descriptions for data and the logic for accessing the data are built into: | application programs |
| A word or phrase that has a specific meaning for the business. | term |
| An association between two or more terms. | fact |
| A statement that defines or constrains some aspect of the business. It is intended to assert business structure or to control or influence the behavior of the business. | business rule |
| A logical representation of the data for an organization or for a business area, using entities for categories of data and relationships for associations between entities. | entity-relationship model (E-R model) |
| A graphical representation of an entity-relationship model. | entity-relationship diagram (E-R diagram) |
| A person, a place, an object, an event, or a concept in the user environment about which the organization wishes to maintain data. | entity |
| A collection of entities that share common properties or characteristics. | entity type |
| A single occurrence of an entity type. | entity instance |
| An entity that exists independently of other entity types. | strong entity type |
| An entity type whose existence depends on some other entity type. | weak entity type |
| The entity type on which the weak entity type depends. | identifying owner |
| The relationship between a weak entity type and its owner. | identifying relationship |
| A property or characteristic of an entity or relationship type that is of interest to the organization. | attribute |
| An attribute that must have a value for every entity (or relationship) instance with which it is associated. | required attribute |
| An attribute that may not have a value for every entity (or relationship) instance with which it is associated. | optional attribute |
| An attribute that has meaningful component parts (attributes). | composite attribute |
| An attribute that cannot be broken down into smaller components that are meaningful to the organization. | simple attribute |
| An attribute that may take on more than one value for a given entity (or relationship) instance. | multivalued attribute |
| An attribute whose values can be calculated from related attribute values. | derived attribute |
| An attribute (or combination of attributes) whose value distinguishes instances of an entity type. | identifier |
| An identifier that consists of a composite attribute. | composite identifier |
| A meaningful association between (or among) entity types. | relationship type |
| An association between (or among) entity instances where each relationship instance associates exactly one entity instance from each participating entity type. | relationship instance |
| 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. | associative entity |
| The number of entity types that participate in a relationship. | degree |
| A relationship between instances of a single entity type. | unary relationship |
| A relationship between the instances of two entity types. | binary relationship |
| A simultaneous relationship among the instances of three entity types. | ternary relationship |
| A rule that specifies the number of instances of one entity that can (or must) be associated with each instance of another entity. | cardinality constraint |
| The minimum number of instances of one entity that may be associated with each instance of another entity. | minimum cardinality |
| The maximum number of instances of one entity that may be associated with each instance of another entity. | maximum cardinality |
| A time value that is associated with a data value, often indicating when some event occurred that affected the data value. | time stamp |
| smallest unit of application data recognized by system software | field |
| A detailed coding scheme recognized by system software, such as a DBMS, for representing organizational data | data type |
| default value | |
| legislates importance of financial data integrity | Sarbanes-Oxley Act (SOX) |
| substitue an estimate of the missing value; construct a report of listing missing values | Handling missing data |
| The process of transforming normalized relations into non- normalized physical record specifications. | Denormalization |
| a table or other data structure used to determine in a file the location of records that satisfy some condition | index |
| A named two-dimensional table of data. | relation |
| An attribute or a combination of attributes that uniquely identifies each row in a relation. | primary key |
| A primary key that consists of more than one attribute. | composite key |
| An attribute in a relation that serves as the primary key of another relation in the same database. | foreign key |
| A value that may be assigned to an attribute when no other value applies or when the applicable value is unknown. | null |
| A rule that states that no primary key attribute (or component of a primary key attribute) may be null. | entity integrity rule |
| A rule that states that either each foreign key value must match a primary key value in another relation or the foreign key value must be null. | referential integrity constraint |
| A relation that contains minimal redundancy and allows users to insert, modify, and delete the rows in a table without errors or inconsistencies. | well-structured relation |
| An error or inconsistency that may result when a user attempts to update a table that contains redundant data. The three types of anomalies are insertion, deletion, and modification anomalies. | anomaly |
| A serial number or other system- assigned primary key for a relation. | surrogate primary key |
| A foreign key in a relation that references the primary key values of the same relation. | recursive foreign key |
| The process of decomposing relations with anomalies to produce smaller, well-structured relations. | normalization |
| A state of a relation that requires that certain rules regarding relationships between attributes (or functional dependencies) are satisfied. | normal form |
| A constraint between two attributes in which the value of one attribute is determined by the value of another attribute. | functional dependency |
| The attribute on the left side of the arrow in a functional dependency. | determinant |
| An attribute, or combination of attributes, that uniquely identifies a row in a relation. | candidate key |
| A relation that has a primary key and in which there are no repeating groups. | first normal form |
| A relation in first normal form in which every nonkey attribute is fully functionally dependent on the primary key. | second normal form |
| A functional dependency in which one or more nonkey attributes are functionally dependent on part (but not all) of the primary key. | partial functional dependency |
| A relation that is in second normal form and has no transitive dependencies. | third normal form |
| A functional dependency between the primary key and one or more nonkey attributes that are dependent on the primary key via another nonkey attribute. | transitive dependency |
| Two (or more) attributes that have different names but the same meaning. | synonyms |
| An alternative name used for an attribute. | alias |
| An attribute that may have more than one meaning. | homonym |
| A primary key whose value is unique across all relations. | enterprise key |
| horizontal partitioning | |
| vertical partitioning | |
| physical file | |
| tablespace | |
| extent | |
| file organization | |
| sequential file organization | |
| indexed file organization | |
| index | |
| secondary key | |
| join index | |
| hashed file organization | |
| hasing algorithm | |
| pointer | |
| hash index table | |
| A database management system that manages data as a collection of tables in which all data relationships are represented by common values in related tables. | relational DBMS (RDBMS) |
| A set of schemas that, when put together, constitute a description of a database. | catalog |
| A structure that contains descriptions of objects created by a user, such as base tables, views, and constraints, as part of a database. | schema |
| Commands used to define a database, including those for creating, altering, and dropping tables and establishing constraints. | data definition language (DDL) |
| Commands used to maintain and query a database, including those for updating, inserting, modifying, and querying data. | data manipulation language (DML) |
| Commands used to control a database, including those for administering privileges and committing (saving) data. | data control language (DCL) |
| A single value returned from an SQL query that includes an aggregate function. | scalar aggregate |
| Multiple values returned from an SQL query that includes an aggregate function. | vector aggregate |
| A table in the relational data model containing the inserted raw data. Base tables correspond to the relations that are identified in the database’s conceptual schema. | base table |
| A table constructed automatically as needed by a DBMS. Virtual tables are not maintained as real data. | virtual table |
| A virtual table that is created dynamically upon request by a user. | dynamic view |
| Copies or replicas of data, based on SQL queries created in the same manner as dynamic views. However, a materialized view exists as a table and thus care must be taken to keep it synchronized with its associated base tables. | materialized view |
Created by:
1456512331036050