There are situations in which we access a table only—or mainly—using the primary key value. Situations such as a code lookup table, or a table containing inverted indexes, fit well in this definition.
In this recipe, we will see how to combine a heap table and a B-tree index in what is called an index organized table, and what benefits—and caveats—we have in performance when adopting this structure to store our data.
The following steps will demonstrate index organized tables:
COUNTRIEStable of the SH schema:
CREATE TABLE IOT_COUNTRIES ( COUNTRY_ID NUMBER NOT NULL, COUNTRY_ISO_CODE CHAR(2) NOT NULL, ...