MULTIMEDIA:

You are building a system to deliver a movie.  Your disk drive can transfer
data at 4 MegaBytes per second, consistently.  The movie is encoded in 1
sec. segments, each of which requires 2 or 5 Megabytes, with equal
probability.  What size of buffer is required to make the probability of
jitter less than 1%.

In a 10 dimensional attribute-space, you are given a query with selectivity
roughly 1 in a million.  If each dimension is identical, independent and has
attributes uniformly distributed, compute what the selectivity is in any one
single dimension.  What is the probability, in any one dimension, that the
mid-point of the attribute value range will be included in the selection.
What is the probability that a value 10% from one extreme will be included?

Why is a nearest neighbor query harder to evaluate than a fixed region query?

Give an example of a spatial join.

Define minimum bounding box.