When storage space is scarce and physical records cannot span pages, creating multiple physical records from one logical relation will minimize wasted storage space.

An extent is a contiguous section of disk storage space.

Two basic constructs to link one piece of data with another piece of data: sequential storage and pointers.

A field represents each component of a composite attribute.

The three newest database architectures in use today are relational, multidimensional and hierarchical.

Denormalization and clustering can work well to minimize data access time for small records.

Some advantages of partitioning include: efficiency, security, and load balancing.

Data-volume and frequency-of-use statistics are not critical inputs to the physical database design process.

In general, larger block sizes are used for online transaction processing applications and smaller block sizes are used for databases with a decision support or data warehousing system.

Hashing algorithm converts a primary key value into a record address.

The primary goal of physical database design is data processing efficiency.

A pointer is a detailed coding scheme recognized by system software for representing organizational data.

Distributing the columns of a table into several separate physical records is known as horizontal partitioning.

It is usually not very important to design the physical database to minimize the time required by users to interact with the information systems.

A bitmap index is an index on columns from two or more tables that come from the same domain of values.