Index-Organized Tables

  • Darl Kuhn
  • Sam R. Alapati
  • Bill Padfield


The simplest explanation of an index-organized table is that it is accessed like any other Oracle table (typically a heap-organized table) but is physically stored like an Oracle B-tree index. Index-organized tables are typically created on “thin” tables (tables without too many columns). Typically, multiple columns of the table make up the primary key of the index-organized table. The non-key columns can also be stored as part of the B-tree index. The proper configuration and use of index-organized tables is fairly specific and does not meet all application needs.


Mapping Table Query Performance Organization Index Bitmap Index Secondary Index 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Darl Kuhn, Sam R. Alapati and Bill Padfield 2016

Authors and Affiliations

  • Darl Kuhn
    • 1
  • Sam R. Alapati
    • 2
  • Bill Padfield
    • 3
  1. 1.MorrisonUSA
  2. 2.Flower MoundUSA
  3. 3.AuroraUSA

Personalised recommendations