## Efficient Indexing of Spatiotemporal Objects (2002)

### Cached

### Download Links

- [www.cs.ucr.edu]
- [research.att.com]
- [www2.research.att.com]
- [www.research.att.com]
- [www2.research.att.com]
- DBLP

### Other Repositories/Bibliography

Citations: | 59 - 11 self |

### BibTeX

@INPROCEEDINGS{Hadjieleftheriou02efficientindexing,

author = {Marios Hadjieleftheriou and George Kollios and Vassilis J. Tsotras and Dimitrios Gunopulos},

title = {Efficient Indexing of Spatiotemporal Objects},

booktitle = {},

year = {2002},

pages = {251--268}

}

### Years of Citing Articles

### OpenURL

### Abstract

Spatiotemporal objects, i.e., objects which change their position and/or extent over time appear in many applications. In this paper we examine the problem of indexing large volumes of such data. Important in this environment is how the spatiotemporal objects move and/or change. We consider a rather general case where object movements/changes are defined by combinations of polynomial functions. We further concentrate on "snapshot" as well as small "interval" queries as these are quite common when examining the history of the gathered data. The obvious approach that approximates each spatiotemporal object by an MBR and uses a traditional multidimensional access method to index them is inefficient. Objects that "live" for long time intervals have large MBRs which introduce a lot of empty space. Clustering long intervals has been dealt in temporal databases by the use of partially persistent indices. What differentiates this problem from traditional temporal indexing, is that objects are allowed to move/change during their lifetime. Better ways are thus needed to approximate general spatiotemporal objects. One obvious solution is to introduce artificial splits: the lifetime of a long-lived object is split into smaller consecutive pieces. This decreases the empty space but increases the number of indexed MBRs. We first give an optimal algorithm and a heuristic for splitting a given spatiotemporal object in a predefined number of pieces. Then, given an upper bound on the total number of possible splits, we present three algorithms that decide how the splits are distributed among all the objects so that the total empty space is minimized. The number of splits cannot be increased indefinitely since the extra objects will eventually affect query performance. Usi...