Database Reference
In-Depth Information
time series database portion of our geo-temporal database because we now know
which
and
when
.
Figure 7-1
shows how this might work with relatively coarse partitioning of spatial data. Two
time series that wander around are shown. If we want to find which time series might inter-
sect the shaded circle and when, we can retrieve intersection information for squares A, B, C,
D, E, and F. To get the actual time series data that overlaps with the circle, we will have to
scan each segment of the time series to find out if they actually do intersect with the circle,
but we only have to scan the segments that overlapped with one of these six squares.
