Consider a crime lab database of criminals. Say there are two tables: H(picture, favorite_bar, ...) has information about human criminals and D(breed, favorite_bar, ...) has information about dog criminals. There are 10,000 known human criminals (i.e., |H| = T(H) = 10,000) and 50,000 known dog criminals (i.e., |D| = T(D) = 50,000). Assume that 10 dog records fit on a block (so B(D) = 5000), but only one human record fits on a block because human records contain a picture (so B(H) = 10,000). Assume also that joined human-dog records take up a whole block. Finally, assume that the crime lab computer has M = 102 blocks of memory available.