What is an optimum in a two-objective (time, space) problem?

Also, how exactly does time help to save space? Is this about some sophisticated hash functions? Handling collisions?