Most anyone who works with indexes should be familiar with B-tree indexes. These are the most commonly used data structures to facilitate faster access to data when we search for exact matches of data using the WHERE clause (or partial matches that can take advantage of the sort order of the index). We’ve covered indexes in this blog already – there, we’ve told you that indexes come in a variety of shapes and sizes including B-tree, hash, spatial, prefix, composite, covering, and clustered indexes.
Some readers of this blog may also know that B-tree indexes have a couple of