320
320
on the specified index, or (if the index is a b-tree) a sequential
321
321
scan followed by sorting. It will attempt to choose the method that
322
322
will be faster, based on planner cost parameters and available statistical
327
327
contains the table data in the index order. Temporary copies of each
328
328
index on the table are created as well. Therefore, you need free space on
329
329
disk at least equal to the sum of the table size and the index sizes.