Skip to main content

Index-Organized Tables

  • Chapter
  • First Online:
Expert Oracle Indexing and Access Paths

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Publish with us

Policies and ethics