Physical database design involves selecting an appropriate storage structure for database tables to minimize disk accesses and maximize performance. Common storage structures include sequential organization, indexing, and B-trees. B-trees provide fast direct and sequential access to records by using a multi-level index structure with leaf nodes containing pointers to data records. The tree must remain balanced during updates to maintain efficient access times.