Indexing animated objects using spatiotemporal access methods

doi:10.1109/69.956099

2001-01-01

PRE

Marios Hadjieleftheriou

DOI：10.1109/69.956099

原文链接

原文求助

摘要

En 中文

We present a new approach for indexing animated objects and efficiently answering queries about their position in time and space. In particular, we consider an animated movie as a spatiotemporal evolution. A movie is viewed as an ordered sequence of frames, where each frame is a 2D space occupied by the objects that appear in that frame. The queries of interest are range queries of the form, find the objects that appear in area S between frames f(i) and f(j) as well as nearest neighbor queries such as, find the q nearest objects to a given position A between frames f(i) and f(j). The straightforward approach to index such objects considers the frame sequence as another dimension and uses a 3D access method (such as, an R-Tree or its variants), This, however, assigns long lifetime intervals to objects that appear through many consecutive frames. Long intervals are difficult to cluster efficiently in a 3D index. Instead, we propose to reduce the problem to a partial-persistence problem. Namely, we use a 2D access method that is made partially persistent. We show that this approach leads to faster query performance while still using storage proportional to the total number of changes in the frame evolution. What differentiates this problem from traditional temporal indexing approaches Is that objects are allowed to move and/or change their extent continuously between frames. We present novel methods to approximate such object evolutions. We formulate an optimization problem for which we provide an optimal solution for the case where objects move linearly. Finally, we present an extensive experimental study of the proposed methods. While we concentrate on animated movies, our approach is general and can be applied to other spatiotemporal applications as well.

Keyword:

access methods

spatiotemporal databases

animated objects

multimedia