|
|
|
     |
                                     |
Return to June 2003, Volume 28, Number 2
, where each result is accompanied by a future interval, during which it is valid. We study time-parameterized and continuous versions of the most common spatial queries (i.e., window queries, nearest neighbors, spatial joins), proposing efficient processing algorithms and accurate cost models.  ©2004 Association for Computing Machinery |
