Managing Hash Clusters MCQs
Managing Hash Clusters MCQs
Our experts have gathered these Managing Hash Clusters MCQs through research, and we hope that you will be able to see how much knowledge base you have for the subject of Managing Hash Clusters by answering these multiple-choice questions.
Get started now by scrolling down!
1: The Implications of dropping hash clusters and tables in hash clusters are not same as those for dropping index clusters?
A. True
B. False
2: When estimating the size of cluster indexes remember that the index is on each cluster key, not the actual rows. Therefore, each key appears only once in the index?
A. False
B. True
3: SORT_AREA SIZE and HASH_AREA_SIZE parameters are ignored in some of the user sessions. What could be the reason?
A. The sessions were started using the login name SYS
B. The User Global Area (UGA) is not configured
C. The sessions are running in the Automatic Shared Memory Management mode
D. None
4: You are using flat files as the data source for one of your data warehousing applications. You plan to move the data from the flat file structures to an Oracle database to optimize the application performance. In your database you have clustered tables. While migrating the data, you want to have minimal impact on the database performance and optimize the data load operation. Which method would you use to load data into Oracle database?
A. Use the external table population
B. Use the conventional path data load of SQL*Loader utility
C. Use the Oracle Data Pump export and import utility
D. Use the direct path data load of Oracle export and import utility
5: A hash cluster provides an alternative to a non-clustered table with an?
A. Index Cluster
B. None
C. Index
D. Index And Index Cluster
6: A hash cluster is created using a DROP CLUSTER statement, but you specify a HASHKEYS clause?
A. False
B. True
7: For maximum distribution of rows in a hash cluster, the database rounds the HASHKEYS value up to the nearest?
A. Prime Number
B. NULL
C. ODD Number
D. None
8: Single-table hash cluster, provides fast access to rows in a table and this table must be the only table in the hash cluster. Essentially, there must be which mapping between hash keys and data rows?
A. None
B. One-to-many mapping
C. One-to-one mapping
D. Many-to-one mapping
9: Even if you decide to use hashing; a table cannot still separate indexes on any columns, including the cluster key?
A. True
B. False
10: In which of these situations hashing is not advantageous?
A. All
B. Applications frequently perform full-table scans on the table and the table is sparsely populated
C. You cannot afford to preallocate the space that the hash cluster will eventually need
D. You cannot afford to preallocate the space that the hash cluster will eventually need
List of Managing Hash Clusters...
Available in:
Managing Hash Clusters MCQs
