An index-organized table has a storage organization that is a variant of a primary B-tree. Unlike an ordinary (heap-organized) table whose data is stored as an unordered collection (heap), data for an ...

The indexes on a the tables of a large database make a huge difference in its performance and utility. Without an index, locating a single record in a large table can take several seconds; with the ...