Indexes for Grade 12

What is a B-tree index?

• A B-tree index is a type of tree used in computer graphics.

• A B-tree index is a data structure used for sorting data in a database.

• A B-tree index is a data structure used to organize and retrieve data in a database.

• A B-tree index is a method for compressing data in a database.

What is a Hash index?

• A hash index is a data structure used in computer science to quickly locate data in a database.

• A hash index is a data structure used to store data in a database.

• A hash index is a method used to sort data in a database.

• A hash index is a type of encryption algorithm used to secure data in a database.

What is a Bitmap index?

• A Bitmap index is a data structure that uses a bitmap to represent the presence or absence of a value in a column of a database table.

• A Bitmap index is a data structure that uses a hash table to represent the presence or absence of a value in a column of a database table.

• A Bitmap index is a data structure that uses a linked list to represent the presence or absence of a value in a column of a database table.

• A Bitmap index is a data structure that uses a binary tree to represent the presence or absence of a value in a column of a database table.

What is a Clustered index?

• A clustered index is a type of index in a database that determines the physical order of data in a table.

• A clustered index is a type of index that is created automatically for every table in a database.

• A clustered index is a type of index that only allows read operations on a table.

• A clustered index is used to sort data in a table based on a non-unique column.

What is a Non-clustered index?

• A non-clustered index is a type of index that is used for sorting data in a database.

• A non-clustered index is a separate structure that contains a sorted list of key values and a pointer to the location of the actual data.

• A non-clustered index is a data structure that stores data in a random order.

• A non-clustered index is a method used to organize data in a database by grouping similar items together.

Which index is commonly used in relational databases?

• Hash index

• Bitmap index

• Clustered index

• B-tree index

Which index is best for equality searches?

• hash index

• b-tree index

• bitmap index

• clustered index

Which index is best for range searches?

• Clustered index

• Hash index

• B-tree index

• Bitmap index

Which index is best for low cardinality columns?

• unique index

• non-clustered index

• clustered index

• full-text index

Which index is best for high cardinality columns?

• non-clustered index

• hash index

• bitmap index

• clustered index