An index stores the values of one or more columns together with pointers to the table rows. Reads that match it get faster, but every insert, update and delete must also maintain it. The most common kind is the B-tree.