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 [t1, t2)” 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 o1 (a point) and o2 (a region) appear. At time 2, object o3 appears, while o1 moves to a new position and o2 shrinks. Object o1 moves again at times 4 and 5; o2continues to shrink and disappears at time 5. Based on its...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aggarwal CC, Agrawal D (2003) On nearest neighbor indexing of nonlinear trajectories. In: PODS, San Diego, pp 252–259
Becker B, Gschwind S, Ohler T, Seeger B, Widmayer P (1996) An asymptotically optimal multiversion B-tree. VLDB J 5(4):264–275
Burton F, Kollias J, Kollias V, Matsakis D (1990) Implementation of overlapping B-trees for time and space efficient representation of collection of similar files. Comput J 33(3):279–280
Cai M, Revesz P (2000) Parametric R-tree: an index structure for moving objects. In: COMAD, Pune, pp 57–64
Chakka VP, Everspaugh A, Patel JM (2003) Indexing large trajectory data sets with SETI. In: CIDR, Asilomar, pp 164–175
Douglas DH, Peucker TK (1973) Algorithms for the reduction of the number of points required to represent a digitised line or its caricature. Can Cartogr 10(2):112–122
Driscoll J, Sarnak N, Sleator D, Tarjan RE (1986) Making data structures persistent. In: STOC, Berkeley
Driscoll JR, Sarnak N, Sleator DD, Tarjan RE (1989) Making data structures persistent. J Comput Syst Sci 38(1):86–124
Faloutsos C, Ranganathan M, Manolopoulos Y (1994) Fast subsequence matching in time-series databases. In: SIGMOD, Minneapolis, pp 419–429
Güting RH, Bhlen MH, Erwig M, Jensen CS, Lorentzos NA, Schneider M, Vazirgiannis M (2000) A foundation for representing and querying moving objects. TODS 25(1):1–42
Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: SIGMOD, Boston, pp 47–57
Hadjieleftheriou M, Kollios G, Tsotras VJ, Gunopulos D (2006) Indexing spatiotemporal archives. VLDB J 15(2):143–164
Keogh EJ, Chu S, Hart D, Pazzani MJ (2001) An online algorithm for segmenting time series. In: ICDM, San Jose, pp 289–296
Kolesnikov A (2003) Efficient algorithms for vectorization and polygonal approximation. PhD thesis, University of Joensuu
Kollios G, Tsotras VJ, Gunopulos D, Delis A, Hadjieleftheriou M (2001) Indexing animated objects using spatiotemporal access methods. TKDE 13(5):758–777
Kumar A, Tsotras VJ, Faloutsos C (1998) Designing access methods for bitemporal databases. TKDE 10(1):1–20
Lomet D, Salzberg B (1989) Access methods for multiversion data. In: SIGMOD, Portland, pp 315–324
Nascimento M, Silva J (1998) Towards historical R-trees. In: SAC, Kingston, pp 235–240
Pagel B-U, Six H-W, Toben H, Widmayer P (1993) Towards an analysis of range query performance in spatial data structures. In: PODS, Washington, DC, pp 214–221
Pavlidis T, Horovitz SL (1974) Segmentation of plane curves. IEEE Trans Comput 23(8):860–870
Pfoser D, Jensen CS, Theodoridis Y (2000) Novel approaches in query processing for moving object trajectories. In: VLDB, Cairo, pp 395–406
Porkaew K, Lazaridis I, Mehrotra S (2001) Querying mobile objects in spatio-temporal databases. In: SSTD, Redondo Beach, pp 59–78
Tao Y, Papadias D (2001) MV3R-tree: a spatio-temporal access method for timestamp and interval queries. In: VLDB, Rome, pp 431–440
Theodoridis Y, Sellis T, Papadopoulos A, Manolopoulos Y (1998) Specifications for efficient indexing in spatiotemporal databases. In: SSDBM, Capri, pp 123–132
Tzouramanis T, Vassilakopoulos M, Manolopoulos Y (2000) Overlapping linear quadtrees and spatio-temporal query processing. Comput J 43(3):325–343
Varman PJ, Verma RM (1997) An efficient multiversion access structure. TKDE 9(3):391–409
Zhu H, Su J, Ibarra OH (2002) Trajectory queries and octagons in moving object databases. In: CIKM, McLean, pp 413–421
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this entry
Cite this entry
Hadjieleftheriou, M., Kollios, G., Tsotras, V., Gunopulos, D. (2017). Indexing Spatiotemporal Archives. In: Shekhar, S., Xiong, H., Zhou, X. (eds) Encyclopedia of GIS. Springer, Cham. https://doi.org/10.1007/978-3-319-17885-1_617
Download citation
DOI: https://doi.org/10.1007/978-3-319-17885-1_617
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-17884-4
Online ISBN: 978-3-319-17885-1
eBook Packages: Computer ScienceReference Module Computer Science and Engineering