The non-keyed storage structure with sequential data entry and access. There is also a compressed heap structure (cheap) with trailing blanks removed.

A keyed storage structure with algorithmically chosen addresses based on key data values. There is also a compressed hash structure (chash) with trailing blanks removed.

A keyed storage structure in which data is sorted by values in key columns for fast access. The index is static and needs remodification as the table grows. There is also a compressed ISAM structure (cISAM) with trailing blanks removed.

A keyed storage structure in which data is sorted by values in key columns, but the index is dynamic and grows as the table grows. There is also a compressed B-tree structure (cB-tree) with trailing blanks removed.

Stores data in columns. Puts as few columns as possible in one disk block (in most cases only one). This is the default for X100 tables. An alias for X100 is VECTORWISE.

Stores data in rows. Puts as many columns as possible in one disk block. In one block, values are still kept in compressed vectors. Potentially, all columns in a row can be stored in a disk block. This type is useful for small tables, especially those with a large number of columns; it saves disk space and disk cache memory. An alias for X100_ROW is VECTORWISE_ROW.