In the context of databases, which type of index uses a separate data structure to store index key values along with pointers to the actual data rows?

The type of index that uses a separate data structure to store index key values along with pointers to the actual data rows in the context of databases is called a "Non-clustered index".

Here are the steps to understand this:

1. In databases, an index is a data structure that improves the speed of data retrieval operations. It works similarly to an index in a book.

2. There are two main types of indexes: Clustered and Non-clustered.

3. A Clustered index determines the physical order of data in a table. There can only be one Clustered index per table. The leaf nodes of a Clustered index contain the data pages of the table.

4. A Non-clustered index, on the other hand, does not alter the physical order of data in the table. Instead, it uses a separate data structure to store index key values along with pointers to the actual data rows. This is why it's possible to have multiple Non-clustered indexes on a table.

5. Therefore, in the context of your question, the type of index that uses a separate data structure to store index key values along with pointers to the actual data rows is a Non-clustered index.