Coarse tables contain key values that describe fine tables or other coarse tables. One entry exists in the coarse tables for each fine table. Several coarse tables are created if more fine tables are present than can be indexed by a single coarse table. These coarse tables are then ordered by another level of coarse tables. This hierarchy continues until only one table remains at the top level; this table is called the root table. A coarse table entry consists of a key value equal to the largest key in the next lower table and a pointer to that table.