Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Darl Kuhn, Sam R. Alapati and Bill Padfield
About this chapter
Cite this chapter
Kuhn, D., Alapati, S.R., Padfield, B. (2016). Index-Organized Tables. In: Expert Oracle Indexing and Access Paths. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-1984-3_4
Download citation
DOI: https://doi.org/10.1007/978-1-4842-1984-3_4
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-1983-6
Online ISBN: 978-1-4842-1984-3
eBook Packages: Professional and Applied ComputingProfessional and Applied Computing (R0)Apress Access Books