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 ...
© Darl Kuhn, Sam R. Alapati and Bill Padfield 2016
Darl Kuhn, Sam R Alapati and Bill Padfield, Expert Oracle Indexing and Access Paths, 10.1007/978-1-4842-1984-3_4
4. Index-Organized Tables
Darl Kuhn1 , Sam R. Alapati2 and Bill Padfield3
(1)Morrison, Colorado, USA
(2)Flower Mound, Texas, USA
(3)Aurora, Colorado, USA
Get Expert Oracle Indexing and Access Paths: Maximum Performance for Your Database now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
