Different types of database indexes?
If for whatever reason somebody else comes across this and is wondering the same thing, I ended up finding a good list at:
http://en.wikipedia.org/wiki/Comparison_of_relational_database_management_systems#Indexes
You should scour harder :-) - Wiki gives a good description
Many of the these concepts are orthogonal. A clustered index means that the rows are arranged in the table in the same order as they appear in the index. Independently, that index can be implemented using a B-tree, a B+ tree, a hash, spatially, etc. And then it may partition the table or not. One aspect may constrain but does not necessarily imply another.