What type of data structure is an index in a database?

The index in a database is usually implemented using a data structure called a B-tree (or its variations, such as a B+ tree). This structure allows efficient search, insert, and delete operations, providing logarithmic complexity. B-trees are optimized for disk-based systems, minimizing the number of read/write operations.