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.
第1题:
While designing your database, you have created the EMPLOYEES table as an index-organized table (IOT). You want to create a bitmap index on the JOB_ID column to make queries faster. Which task must have been completed so that you are able to create the bitmap index?()
第2题:
Which two statements are true about constraints? ()
第3题:
Which two statements are true about a bitmap index? ()
第4题:
Which two statements are true regarding B-tree index()
第5题:
A bitmap join index is defined as().
第6题:
The InnoDB engine has a feature known as clustered indexes. Which three statements are true about clustered indexes as used in InnoDB?()
第7题:
It is ignored by the query optimizer.
It is not used while the index is being rebuilt.
The index cannot be rebuilt, and has to be re-created.
The index is automatically rebuilt when used the next time
第8题:
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
第9题:
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.
第10题:
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.
第11题:
It is not possible to disable the primary key constraint.
It is possible to have more than one primary key constraint in a single table.
The primary key constraint can be referred by only one foreign key constraint.
The primary key constraint can be imposed by combining more than one column.
The non-deferrable primary key constraint creates an unique index on the primary key column if it is not already indexed.
第12题:
A primary key must have been created.
A mapping table must have been created.
An overflow tablespace must have been specified.
The PCTTHRESHOLD option must have been specified.
第13题:
Which two statements are true about the primary key constraint in a table? ()
第14题:
Which two statements are true regarding B-tree indexs()
第15题:
You are using Oracle Enterprise Manager to estimate the size of a table to be created. You have typed data regarding the column names, data types, sizes of the columns, and the projected number of rows in the table. Which additional information does the Oracle Enterprise Manager return?()
第16题:
Why does performance degrade when many UPDATE, INSERT, or DELETE statements are issued on a tablethat has an associated Bitmap index()
第17题:
You have altered a non-unique index to be invisible to determine if queries execute within an acceptable response time without using this index. Which two are possible if table updates are performed which affect the invisible index columns?()
第18题:
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.
第19题:
space allocated in the tablespace
space required for the bitmap index on a column of the table
space remaining in the tablespace after creating the table
estimated value of the PCTFREE storage parameter
第20题:
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.
第21题:
A primary key must have been created.
A mapping table must have been created.
An overflow tablespace must have been specified.
The PCTTHRESHOLD option must have been specified.
第22题:
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.
第23题:
An index used to join two bitmap indexes on a table.
A bitmap index created for the join of two or more tables.
A bitmap index created on the join of two or more indexes.
A bitmap index created on the join of two or more indexed-organized tables.
第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