Q1
True / FalseIn ORACLE, a B-tree index is the default type of index created.
The B-tree index is the default and most commonly used type of index in ORACLE, providing efficient access for a wide variety of queries.
Q2
True / FalseIn ORACLE, a unique index ensures that no two rows have the same value in the indexed column(s).
A unique index enforces the uniqueness of the values in the indexed columns, preventing duplicate entries.
Q3
True / FalseIn ORACLE, indexes can only be created on single columns.
ORACLE allows the creation of composite indexes, which can index multiple columns in a single index.
Q4
True / FalseIn ORACLE, bitmap indexes are suitable for high cardinality columns.
Bitmap indexes are suitable for columns with low cardinality, where the number of distinct values is relatively small.
Q5
True / FalseIn ORACLE, a function-based index can be created on an expression or a function.
Function-based indexes allow indexing based on expressions or functions applied to one or more columns, enhancing performance for queries using those expressions.
Q6
True / FalseIn ORACLE, global indexes are partitioned indexes that span all partitions of a table.
Global indexes are not tied to any specific partition and span all the partitions of a partitioned table.
Q7
True / FalseIn ORACLE, a reverse key index is used to evenly distribute insertions across all leaf blocks.
A reverse key index reverses the bytes of the indexed columns, helping to distribute insertions more evenly and reduce contention.
Q8
True / FalseIn ORACLE, domain indexes are user-defined indexes specific to a particular application.
Domain indexes are custom indexes created for specialized applications and data types, allowing indexing of complex data structures.
Q9
True / FalseIn ORACLE, a cluster index is used to enforce unique constraints on cluster keys.
A cluster index is created on a cluster and is used to physically store rows of different tables that are related by common column values in the same data blocks.
Q10
True / FalseIn ORACLE, index-organized tables (IOTs) store the entire table data in the index structure.
Index-organized tables store their data in a B-tree index structure, which allows for fast access to both the key and the non-key columns, making the index and table storage more efficient.