Specifications for efficient indexing in spatiotemporal databases
Authors:
- Y. TheodoridisYTY. Theodoridis
- T. SellisTST. Sellis
- A.N. PapadopoulosAPA.N. Papadopoulos
- Y. ManolopoulosYMY. Manolopoulos
- 1 January 1998
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 123-132
Abstract
A new issue that arises in modern applications involves the efficient manipulation of (static or moving) spatial objects, and the relationships among them. As a result, modern database systems should be able to efficiently support that type of data. Towards this goal, appropriate extensions of multidimensional access methods can be exploited in order to index and retrieve spatiotemporal objects, satisfying users' demands. This paper introduces the basic specifications such a spatiotemporal index structure should follow, evaluates existing proposals with respect to the above specifications, and illustrates issues of interest involving object representation, query processing, and index maintenance.Keywords
This publication has 19 references indexed in Scilit:
- Towards historical R-trees1998
- Spatial relations, minimum bounding rectangles, and spatial data structuresInternational Journal of Geographical Information Science, 1997
- Spatio-temporal indexing for large multimedia applications1996
- Nearest neighbor queries1995
- A consensus glossary of temporal database conceptsACM SIGMOD Record, 1994
- A Unified Model for Spatial and Temporal InformationThe Computer Journal, 1994
- Efficient processing of spatial joins using R-trees1993
- Fully persistent B+-trees1991
- Access methods for multiversion data1989
- Redundancy in spatial databases1989