Q&A Hero

Q: Typically, the __________________________________________________ scenario requires a network file server running conventional applications that are accessed through a network.

Q: The __________________________________________________ scenario is typical of most mainframe and midrange server computer DBMSs.

Q: A transaction processor is also known as the ____________________ processor.

Q: In a DDBMS, ____________________ control is used to manage simultaneous data access and ensure data consistency across database fragments.

Q: In a DDBMS, query ____________________ is used to find the best access strategy.

Q: In a DDBMS, ____________________ occurs to determine the data location of local and remote fragments.

Q: ____________________ management ensures that data move from one consistent state to another, including synchronization of local and remote transactions.

Q: One of the advantages of a DDBMS is processor ____________________.

Q: One of the advantages of a DDBMS is less danger of a single-____________________ failure.

Q: A user-friendly ____________________ is one advantage of a DDBMS.

Q: One of the advantages of a DDBMS is ____________________ operating cost.

Q: A(n) ____ database stores each database fragment at a single site.a. partially replicated b. unreplicated c. fully replicatedd. partitioned

Q: The ____ rule requires that all copies of data fragments be identical.a. shared fragment b. mutual consistency c. horizontal fragmentationd. replication

Q: ____ fragmentation refers to the division of a relation into attribute subsets.a. Data b. Horizontal c. Verticald. Mixed

Q: ____ fragmentation refers to the division of a relation into subsets of tuples.a. Vertical b. Horizontal c. Datad. Mixed

Q: ____ fragmentation allows you to break a single object into two or more segments or fragments.a. Horizontal b. Vertical c. Datad. Mixed

Q: ____ is the delay imposed by the amount of time required for a data packet to make a round trip from point A to point B.a. Data distribution b. Replica transparency c. Network latencyd. Network partitioning

Q: The objective of ____ optimization is to minimize the total cost associated with the execution of a request.a. data b. remote c. transactiond. query

Q: The ____ guarantees that if a portion of a transaction operation cannot be committed, all changes made at the other sites participating in the transaction will be undone to maintain a consistent database state.a. DO-UNDO-REDO protocol b. two-phase commit protocol (2PC) c. coordinator protocold. write-ahead protocol

Q: The ability to execute a ____ request provides fully distributed database processing because you can partition a database table into several fragments.a. distributed b. transaction c. fragmentedd. transparent

Q: A distributed ____ allows a transaction to reference several different remote database processing sites.a. request b. site c. data locationd. transaction

Q: A ____ contains the description of the entire database as seen by the database administrator.a. distributed global dictionary b. distributed data dictionary c. distributed global schemad. distributed data schema

Q: ____ transparency exists when the end user or programmer must specify both the fragment names and their locations.a. Local mapping b. Location c. Performanced. Transaction

Q: ____ transparency exists when the end user or programmer must specify the database fragment names but does not need to specify where these fragments are located.a. Transaction b. Location c. Local mappingd. Fragmentation

Q: ____ transparency is the highest level of transparency. The end user or programmer does not need to know that a database is partitioned.a. Performance b. Fragmentation c. Locationd. Local mapping

Q: ____ transparency allows the integration of several different local DBMSs under a common, or global, schema.a. Transaction b. Performance c. Distributiond. Heterogeneity

Q: ____ transparency allows the system to perform as if it were a centralized database management system.a. Heterogeneity b. Distribution c. Performanced. Failure

Q: ____ transparency ensures that the system will continue to operate in the event of a node failure.a. Transaction b. Distribution c. Failured. Performance

Q: ____ transparency allows a transaction to update data at several network sites.a. Transaction b. Distribution c. Failured. Performance

Q: ____ transparency allows a distributed database to be treated as a single logical database.a. Distributionb. Transaction c. Failured. Performance

Q: A ____ distributed database system will support different DBMSs that may even support different models running under different computer systems.a. fully heterogeneous b. fully homogeneous c. homogeneousd. heterogeneous

Q: ____ distributed database systems integrate different types of centralized DBMSs over a network.a. Homogeneous b. Heterogeneous c. Fully homogeneousd. Combination

Q: ____ distributed database systems integrate only one type of centralized DBMS over a network.a. Homogeneous b. Heterogeneous c. Fully heterogeneousd. Combination

Q: The ____ scenario describes a fully distributed DBMS with support for multiple data processors and transaction processors at multiple sites. a. multiple-site processing, single-site data b. single-site processing, multiple-site data c. single-site processing, single-site data d. multiple-site processing, multiple-site data

Q: Under the ____ scenario, multiple processes run on different computers sharing a single data repository. a. single-site processing, single-site data b. multiple-site processing, single-site data c. single-site processing, multiple-site data d. multiple-site processing, multiple-site data

Q: The ____ processor is the software component residing on each computer that stores and retrieves data located at the site.a. transactionb. network c. datad. management

Q: The ____ processor is the software component found in each computer that requests data. It receives and processes the application's data requests.a. database b. transaction c. datad. network

Q: A distributed database is composed of several parts known as database ____.a. sections b. fragments c. partitionsd. parts

Q: ____ are an advantage of a DDBMS.a. Reduced operating costs b. Simplicity of management and control c. Decreased storage requirementsd. Decreased training costs

Q: ____ is a disadvantage of a DDBMS.a. Processor independence b. The graphical user interface c. Securityd. Data access that is too rapid

Q: ____ is a disadvantage of a DDBMS. a. Data is located near the "greatest demand" site b. Growth facilitation c. Danger of a single-point failure d. Lack of standards

Q: A remote transaction, composed of several requests, may access data at multiple sites.

Q: Distributed database systems do not require complex mechanisms to manage transactions and ensure the database's consistency and integrity.

Q: A distributed database system requires functional characteristics that can be grouped and described as transparency features.

Q: A transaction processor is the software component residing on each computer that stores and retrieves data located at the site.

Q: A DDBMS must be communications-media-dependent.

Q: The TP is the software component found in each computer that requests data.

Q: A fully distributed DBMS must perform all the functions of a centralized DBMS, and it must handle all necessary functions imposed by the distribution of data and processing.

Q: A DBMS must have validation, transformation, and mapping functions, as well as other functions, in order to be classified as distributed.

Q: Both distributed processing and distributed databases require a network to connect all components.

Q: In order to manage distributed data, copies or parts of the database processing functions must be distributed to all data storage sites.

Q: Distributed processing does not require a distributed database, and a distributed database does not require distributed processing.

Q: The inherently complex distributed data environment increases the urgency for standard protocols governing transaction management.

Q: Distributed processing shares the database's logical processing among two or more physically independent sites that are connected through a network.

Q: Current DDBMSs are subject to some problems, such as the complexity of management and control.

Q: One of the advantages of a DDBMS is security.

Q: One of the advantages of a DDBMS is improved communication.

Q: One of the advantages of a DDBMS is growth facilitation.

Q: One of the advantages of a DDBMS is that the data is located near the site with the least demand.

Q: The World Wide Web (the Web) is the repository for distributed data.

Q: A DDBMS governs the storage and processing of logically related data over interconnected computer systems.

Q: From a system functionality point of view, ____ attribute values can be calculated when they are needed to write reports or invoices.a. derived b. atomic c. granulard. historical

Q: Granularity refers to ____. a. the size of a table b. the level of detail represented by the values stored in a table's row c. the number of attributes in a table d. the number of rows in a table

Q: The most likely data type for a surrogate key is ____.a. Character b. Date c. Logicald. Numeric

Q: An atomic attribute ____.a. cannot exist in a relational table b. cannot be further subdivided c. displays multiplicityd. is always chosen to be a foreign key

Q: Improving ____ leads to more flexible queries.a. atomicity b. normalization c. denormalizationd. derived attributes

Q: According to naming conventions described in Chapter 2, ____ would be the best name for a column representing the charges per hour in a table named JOB.a. JOB_CHG_HOUR b. CHARGES_PER_HOUR_FOR_JOB c. CHARGES_PER_HOURd. CHG_HR

Q: A table that is in 2NF and contains no transitive dependencies is said to be in ____.a. 1NF b. 2NF c. 3NFd. 4NF

Q: If a table has multiple candidate keys and one of those candidate keys is a composite key, the table can have ____ based on this composite candidate key, even when the primary key chosen is a single attribute.a. Boyce-Codd Normal Form b. redundancy c. time-varianced. partial dependencies

Q: Before converting a table into 3NF, it is imperative the table already be in ____.a. 1NF b. 2NF c. 4NFd. BCNF

Q: If you have three different transitive dependencies, ____ different determinant(s) exist.a. one b. two c. threed. four

Q: A table that is in 1NF and includes no partial dependencies is said to be in ____.a. BCNF b. 2NF c. 3NFd. 4NF

Q: A table that has all key attributes defined, has no repeating groups, and all its attributes are dependent on the primary key, is said to be in ____.a. 1NF b. 2NF c. 3NFd. 4NF

Q: In a(n) ____ diagram, the arrows above the attributes indicate all desirable dependencies.a. Chen b. dependency c. functionalityd. ER

Q: Dependencies based on only a part of a composite primary key are called ____ dependencies.a. primary b. partial c. incompleted. composite

Q: A relational table must not contain a(n) ____.a. entity b. attribute c. relationshipd. repeating group

Q: A ____ derives its name from the fact that a group of multiple entries of the same type can exist for any single key attribute occurrence.a. partial dependency b. transitive dependency c. repeating groupd. primary key

Q: Attribute A ____ attribute B if all of the rows in the table that agree in value for attribute A also agree in value for attribute B.a. determines b. derives from c. controlsd. owns

Q: A(n) ____ exists when there are functional dependencies such that Y is functionally dependent on X and Z is functionally dependent on Y, and X is the primary key.a. partial dependency b. repeating group c. atomic attributed. transitive dependency

Q: Of the following normal forms, ____ is mostly of theoretical interest.a. 1NF b. 3NF c. BCNFd. DKNF