An index-organized table has a storage organization that is a variant of a primary B-tree. Data for an index-organized table is stored in a B-tree index structure in a primary key sorted manner. Each leaf block in the index structure stores both the key and nonkey columns.
Index-organized tables have full table functionality. They support features such as constraints, triggers etc with additional features such as key compression.