DB2 stores indexes using B-tree structures, which provide efficient search, insert, and delete operations. B-trees are the industry standard for database indexes because they maintain sorted data and allow logarithmic time complexity. Hash tables, AVL trees, and Red-Black trees are not used for DB2 indexes.