An Analysis on Update Strategies for Spatio-Temporal Indexing
Lakshmi Balasubramanian1, M. Sugumaranj2

1Lakshmi Balasubramanian, Department of Computer Science and Engineering, Pondicherry Engineering College, Puducherry, India.
2Sugumaran. M, Department of Computer Science and Engineering, Pondicherry Engineering College, India.

Manuscript received on April 11, 2012. | Revised Manuscript received on April 14, 2012. | Manuscript published on May 05, 2012. | PP: 395-398 | Volume-2 Issue-2, May 2012 . | Retrieval Number: B0629042212/2012©BEIESP
Open Access | Ethics and Policies | Cite 
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (

Abstract: Many applications such as location based systems, traffic monitoring, radio frequency identification, sensor networks etc., benefit from spatio-temporal indexing. R-Tree based index structures are widely used for indexing the spatial information. The main issue to be considered is frequent updates. These applications pose frequent updates which have to be reflected in the index structure. Frequent changes to the index structure causes more overhead. Recent research is to handle these frequent updates efficiently. This paper presents the state of art in the update strategies adopted in spatio-temporal indexing. This work provides an idea of the present development in updating techniques for spatio-temporal indexing.

Keywords: R-Trees, Spatio-Temporal Indexing, Update Strategies.