The leaf blocks in the index are doubly linked.
The leaf node stores a bitmap for each key value.
The rows with NULL value in key columns also have entries in the index.
The deletion of a row from the table causes a logical deletion in index leaf block and the space becomes available for the new leaf entry.
第1题:
Which two statements are true about a bitmap index? ()
第2题:
What two statements are true regarding the recommendations received from the SQL Access Advisor?()(Choose two.)
第3题:
You work as a database administrator for Certkiller .com. As a result of performance analysis, you created an index on theprod_namecolumn of the Certkiller prodtable, which contains about ten thousand rows. Later, you updated a product name in the table. How does this change affect the index?()
第4题:
Which two statements are true regarding B-tree index()
第5题:
What two statements are true regarding the recommendations received from the SQL Access Advisor?()
第6题:
A leaf will be marked as invalid.
An update in a leaf row takes place.
The index will be updated automatically at commit.
A leaf row in the index will be deleted and inserted.
The index becomes invalid when you make any updates
第7题:
The same key is used for encryption and decryption.
It is commonly used to create digital certificate signatures.
It uses two keys: one for encryption and a different key for decryption.
An attacker can decrypt data if the attacker captures the key used for encryption
第8题:
An update in a leaf row takes place.
The index becomes invalid after the update.
The leaf block containing the row to be updated is marked as invalid.
A row in the leaf block of the index for the key value is logically deleted and a new leaf row is inserted
第9题:
A primary key must exist for creation of a clustered index
A clustered index allows fulltext searching within InnoDB
The first unique index is always used as a clustered index and not a primary key
A clustered index provides direct access to a page containing row data
If no indexes exist, a hidden clustered index is generated based on row IDs
A primary key is used as a clustered index
A clustered index is a grouping of indexes from different tables into a global index for faster searching
第10题:
The index remains invisible.
The index is not updated by the DML statements on the indexed table.
The index automatically becomes visible in order to have it updated by DML on the table.
The index becomes unusable but the table is updated by the DML.
The index is updated by the DML on the table.
第11题:
The leaf blocks in the index are doubly linked.
The leaf node stores a bitmap for each key value.
The rows with NULL value in key columns also have entries in the index.
The deletion of a row from the table causes a logical deletion in index leaf block and the space becomes available for the new leaf entry.
第12题:
The same key is used for encryption and decryption.
It is commonly used to create digital certificate signatures.
It uses two keys: one for encryption and a different key for decryption.
An attacker can decrypt data if the attacker captures the key used for encryption.
第13题:
As a result of performance analysis, you created an index on the prod_name column of the prod_det table, which contains about ten thousand rows. Later, you updated a product name in the table. How does this change affect the index?()
第14题:
Which statement describes the effect on an index, when the indexed column for the rows is updatedin the base table()
第15题:
The SCOTT user has an index on the ITEM_DESC column of the ITEM table. As part of the year-ending task, SCOTT updates the ITEM_DESC column for most of the rows in the ITEM table. How does this change to the table affect the index?()
第16题:
Why does performance degrade when many UPDATE, INSERT, or DELETE statements are issued on a tablethat has an associated Bitmap index()
第17题:
The InnoDB engine has a feature known as clustered indexes. Which three statements are true about clustered indexes as used in InnoDB?()
第18题:
It cannot generate recommendations that support multiple workload queries.
It can recommend partitioning on tables provided that the workloads have some predicates and joins on the columns of the NUMBER or DATE type.
It can recommend partitioning only on tables that have at least 10,000 rows.
It can recommend only B-tree indexes and not bitmap or function-based indexes
第19题:
The DML operations re-create the Bitmap index blocks.
The Bitmap index is rebuilt automatically after a DML operation.
The smallest amount of a bitmap that can be locked is a bitmap segment.
Additional time is taken to remove NULL values from the Bitmap index after a DML operation.
第20题:
It cannot generate recommendations that support multiple workload queries.
It can recommend partitioning on tables provided that the workloads have some predicates and joins on the columns of the NUMBER or DATE type.
It can recommend partitioning only on tables that have at least 10,000 rows.
It can recommend only B-tree indexes and not bitmap or function-based indexes.
第21题:
An update in a leaf row takes place.
The index becomes invalid after the update.
The leaf block containing the row to be updated is marked as invalid.
A row in the leaf block of the index for the key value is deleted and inserted.
第22题:
It is recommended for the columns that have unique values.
It can be converted to a B-tree index by using the ALTER INDEX command.
It has a bitmap segment for each distinct value in the key column, containing a string of bits in which each bit represents the presence or absence of a key column value.
Updating the key column locks the whole bitmap segment that contains the bit for the key value to be updated.
第23题:
The UNIQUE constraint does not permit a null value for the column.
A UNIQUE index gets created for columns with PRIMARY KEY and UNIQUE constraints.
The PRIMARY KEY and FOREIGN KEY constraints create a UNIQUE index.
The NOT NULL constraint ensures that null values are not permitted for the column.
第24题:
The leaf blocks in the index are doubly linked.
The leaf node stores a bitmap for each key value.
The rows with NULL value in key columns also have entries in the index.
The deletion of a row from the table causes a logical deletion in index leaf block and the space becomesavailable for the new leaf entry