click below
click below
Normal Size Small Size show me how
CIW Db Design Mgmt
Definitions
| Question | Answer |
|---|---|
| An attribute's value that cannot be divided into multiple pieces of information. | atomic value |
| The relations actually defined within a database. | base tables |
| Testing an application without internal knowledge of the code. | black-box testing |
| The number of rows in a relation. | cardinality |
| (attribute) A property of a relation. | column |
| The final step in the successful completion of a database transaction. | commit |
| A primary or foreign key that is made up of multiple attributes. | composite key |
| The management of simultaneous transactions so that the transactions do not conflict with one another. | concurrency control |
| A language used to control access to data in a database. | Data Control Language (DCL) |
| A descriptive language used to create and name entities and the relationships between them in a database. | Data Definition Language (DDL) |
| A set of tables created as a result of DDL operations that hold metadata about a database. | data dictionary |
| A language that provides the interface necessary to perform data operations on data within a database. | Data Manipulation Language (DML) |
| A formal method of describing data and data relationships. | data model |
| A collection of data organized to provide efficient management of the data as well as easy access to and updating of the data. | database |
| The person who directs or performs all activities related to maintaining a database environment. | database administrator |
| Software that supports the creation and management of databases. | database management system |
| A situation in which two or more transactions are simultaneously waiting for another transaction to release a lock on a data item. | deadlock |
| The process of creating new relations from existing relations based on functional dependencies within the original relation. | decomposition |
| The number of attributes in a relation. | degree |
| A circumstance in which wanted data is deleted from a relation. | deletion anomaly |
| The rejoining of relations that were decomposed during normalization. | denormalization |
| An attribute or group of attributes on which another attribute is functionally dependent. | determinant |
| The allowable values for an attribute. | domain |
| A set of restrictions on the values allowed for the attributes of relations. | domain constraints |
| A uniquely identifiable element about which data is stored in a database. | entity |
| A conceptual database design method that describes relationships between entities. | entity-relationship (ER) modeling |
| A client that performs the bulk of the data-processing operations. | fat client |
| A file containing records that have no structured interrelationship. | flat-file database |
| A column or concatenated columns that are identical to the primary key of a relation in the same database. | foreign key |
| A relationship between two attributes indicating that for each unique attribute A, there is only one value of attribute B. | functional dependency |
| A circumstance in which data may not be entered into a relation because a complete primary key is not available. | insertion anomaly |
| An entity created as a result of the decomposition of a relation while resolving a many-to-many relationship. | intermediate entity |
| A method used to monitor concurrent access to data in which one transaction is denied access to data until another transaction is complete. | locking |
| A number of special properties or constraints that a relation must possess to achieve certain desired goals, such as minimizing unwanted data redundancy. | normal form |
| The process of organizing and refining relations within a relational database. | normalization |
| A database value meaning "unknown." | null |
| The primary key referenced by a foreign key. | parent key |
| In a functional dependency, when B is functionally dependent on A, and an attribute can be removed from A and the dependency still exists, B is said to be ______ _______ _________ on A. | partially functional dependent |
| A unique identifier within a row. | primary key |
| The part of a nonprocedural DML that retrieves data from a database. | query language |
| An entity relationship in which an entity is involved in a relationship with itself. | recursive relationship |
| A relational constraint stating that every foreign key that is not null must reference an existing primary key value. | referential integrity |
| A two-dimensional table consisting of columns and rows in a relational database. | relation |
| A collection of data organized as a set of formally described tables. | relational database |
| A formal definition of the specifications for software, an application or a database. | requirements document |
| The undoing of a partially completed database transaction that is determined to have failed. | rollback |
| (tuple) The collection of one set of attributes in a relation. | row |
| The entire organization or structure of a database. | schema |
| The process used by a DBMS to determine whether a set of transactions will produce the same result as some serial execution of the same transactions. | serializability |
| An entity whose data is meaningful without having to reference another entity in the data model. | strong entity |
| A language used to create professional, high-performance corporate databases. | Structured Query Language |
| Part of a database that describes the data in the database. | system catalog |
| A client designed to be small so that the bulk of the data processing occurs on the server. | thin client |
| A unique identifier assigned by a DBMS to a transaction. | timestamp |
| A single event or sequence of actions such as a database update or data retrieval operation that is treated as a unit, both to satisfy a request and to ensure database integrity. | transaction |
| In a functional dependency, if B is functionally dependent on A, and C is functionally dependent on B, C is then said to be ______ _______ on A. | transitively dependent |
| A circumstance in which redundant data in a relation may not be properly updated. | update anomaly |
| A data operation given a name and stored in a database that creates virtual tables when invoked by a user. | view |
| Database relations created as a result of a data manipulation operation and not a permanent part of the database. | virtual tables |
| An entity that must reference another entity for its data to be meaningful. | weak entity |
| The use of internal knowledge of the code for an application when conducting tests. | white-box testing |