Synonyms
Spatio-temporal index structures; Moving objects; Life-time; Evolution; Indexing, native-space; Indexing, parametric space; Index, R‑tree; Index, MVR‑tree
Definition
Consider a number of objects moving continuously on a 2‐dimensional universe over some time interval. Given the complete archive of the spatio‐temporal evolution of these objects, we would like to build appropriate index structures for answering range and nearest neighbor queries efficiently. For example: “Find all objects that appeared inside area S during time-interval \( [t_1, t_2) \) ” and “Find the object nearest to point P at time t”.
Consider the spatio‐temporal evolution appearing in Fig. 1. The X and Y axes represent the plane while the T axis corresponds to the time dimension. At time 1 objects \( o_1 \) (a point) and \( o_2 \) (a region) appear. At time 2, object \( o_3 \) appears, while \( o_1 \) moves to a new position and \( o_2 \) shrinks. Object \( o_1 \) moves again at times 4 and 5; \( o_2 \)...
Notes
- 1.
Where K is implied by some space constraint, e. g., the available disk space.
Recommended Reading
Aggarwal, C.C., Agrawal, D.: On nearest neighbor indexing of nonlinear trajectories. In: PODS, pp. 252–259 (2003)
Becker, B., Gschwind, S., Ohler, T., Seeger, B., Widmayer, P.: An asymptotically optimal multiversion B-Tree. VLDB J. 5(4), 264–275 (1996)
Burton, F., Kollias, J., Kollias, V., Matsakis, D.: Implementation of overlapping B‑trees for time and space efficient representation of collection of similar files. Comput. J., 33(3), 279–280 (1990)
Cai, M., Revesz, P.: Parametric R‑tree: An index structure for moving objects. In: COMAD, pp. 57–64 (2000)
Chakka, V.P., Everspaugh, A., Patel, J.M.: Indexing large trajectory data sets with SETI. In: CIDR, pp. 164–175 (2003)
Douglas, D.H., Peucker, T.K.: Algorithms for the reduction of the number of points required to represent a digitised line or its caricature. Can. Cartogr. 10(2), 112–122 (1973)
Driscoll, J., Sarnak, N., Sleator, D., Tarjan, R.E.: Making data structures persistent. In: STOC (1986)
Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making data structures persistent. J. Comput. Syst. Sci. 38(1), 86–124 (1989)
Faloutsos, C., Ranganathan, M., Manolopoulos, Y.: Fast subsequence matching in time-series databases. In: SIGMOD, pp. 419–429 (1994)
Güting, R.H., Bhlen, M.H., Erwig, M., Jensen, C.S., Lorentzos, N.A., Schneider, M., Vazirgiannis, M.: A foundation for representing and querying moving objects. TODS 25(1), 1–42 (2000)
Guttman, A.: R‑trees: A dynamic index structure for spatial searching. In: SIGMOD, pp. 47–57 (1984)
Hadjieleftheriou, M., Kollios, G., Tsotras, V.J., Gunopulos, D.: Indexing spatiotemporal archives. VLDB J. 15(2), 143–164 (2006)
Keogh, E.J., Chu, S., Hart, D., Pazzani, M.J.: An online algorithm for segmenting time series. In: ICDM, pp. 289–296 (2001)
Kolesnikov, A.: Efficient algorithms for vectorization and polygonal approximation. PhD thesis, University of Joensuu, Finland, (2003)
Kollios, G., Tsotras, V.J., Gunopulos, D., Delis, A., Hadjieleftheriou, M.: Indexing animated objects using spatiotemporal access methods. TKDE 13(5), 758–777 (2001)
Kumar, A., Tsotras, V.J., Faloutsos, C.: Designing access methods for bitemporal databases. TKDE 10(1), 1–20 (1998)
Lomet, D., Salzberg, B.: Access methods for multiversion data. In: SIGMOD, pp. 315–324 (1989)
Nascimento M., Silva, J.: Towards historical R‑trees. In: SAC, pp. 235–240 (1998)
Pagel, B.-U., Six, H.-W., Toben, H., Widmayer, P.: Towards an analysis of range query performance in spatial data structures. In: PODS, pp. 214–221 (1993)
Pavlidis, T., Horovitz, S.L.: Segmentation of plane curves. IEEE Trans. Comput. 23(8), 860–870 (1974)
Pfoser, D., Jensen, C.S., Theodoridis, Y.: Novel approaches in query processing for moving object trajectories. In: VLDB, pp. 395–406 (2000)
Porkaew, K., Lazaridis, I., Mehrotra, S.: Querying mobile objects in spatio-temporal databases. In: SSTD, pp. 59–78 (2001)
Tao, Y., Papadias, D.: MV3R-Tree: A spatio-temporal access method for timestamp and interval queries. In: VLDB, pp. 431–440 (2001)
Theodoridis, Y., Sellis, T., Papadopoulos, A., Manolopoulos, Y.: Specifications for efficient indexing in spatiotemporal databases. In: SSDBM, pp. 123–132 (1998)
Tzouramanis, T., Vassilakopoulos, M., Manolopoulos, Y.: Overlapping linear quadtrees and spatio-temporal query processing. Comput. J. 43(3), 325–343 (2000)
Varman, P.J., Verma, R.M.: An efficient multiversion access structure. TKDE 9(3), 391–409 (1997)
Zhu, H., Su, J., Ibarra, O.H.: Trajectory queries and octagons in moving object databases. In: CIKM, pp. 413–421 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag
About this entry
Cite this entry
Hadjieleftheriou, M., Kollios, G., Tsotras, V., Gunopulos, D. (2008). Indexing Spatio-temporal Archives. In: Shekhar, S., Xiong, H. (eds) Encyclopedia of GIS. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35973-1_617
Download citation
DOI: https://doi.org/10.1007/978-0-387-35973-1_617
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-30858-6
Online ISBN: 978-0-387-35973-1
eBook Packages: Computer ScienceReference Module Computer Science and Engineering