Specifications for efficient indexing in spatiotemporal databases
- 1 January 1998
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 123-132
- https://doi.org/10.1109/ssdm.1998.688117
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 22 references indexed in Scilit:
- Indexing techniques for historical databasesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Towards historical R-treesPublished by Association for Computing Machinery (ACM) ,1998
- Spatial relations, minimum bounding rectangles, and spatial data structuresInternational Journal of Geographical Information Science, 1997
- Nearest neighbor queriesPublished by Association for Computing Machinery (ACM) ,1995
- 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-treesPublished by Association for Computing Machinery (ACM) ,1993
- Fully persistent B+-treesPublished by Association for Computing Machinery (ACM) ,1991
- Access methods for multiversion dataPublished by Association for Computing Machinery (ACM) ,1989
- Redundancy in spatial databasesPublished by Association for Computing Machinery (ACM) ,1989