Section 5

Question 1

Heap Table

Answer 1

No order is imposed on rows. The database maintains a list of blocks assigned to the table, along with the address of the first available space for inserts. If all blocks are full, the database allocates a new block and inserts rows in the new block

Question 2

What are heap tables not optimized for?

Answer 2

Queries that read rows in a specific order, such as a range of primary key values, since rows are scattered randomly across storage media.

Question 3

Sorted table

Answer 3

The database designer identifies a sort column that determines physical row order.

Question 4

Binary Search

Answer 4

the database repeatedly splits the index in two until it finds the entry containing the search value

Question 5

Logical Design

Answer 5

specifies tables, columns, and keys

Question 6

Physical Design

Answer 6

specifies indexes, table structures, and partitions