We began the course with Part 1, where we presented the theoretical basics of database indexes.

Databases may differ when it comes to index structure, but most of them use B-trees or B+trees. These data structures resemble upside down trees. They allow you to quickly find rows based on values in a given column (or columns). They look something like this:

However, creating and managing such structures is time-consuming. Indexes speed up the selection of data, but they slow down adding, updating, and deleting rows.