DMCA
Indexing Spatio-temporal Archives
Cached
Download Links
| Venue: | THE VLDB JOURNAL |
| Citations: | 31 - 4 self |
BibTeX
@MISC{Hadjieleftheriou_indexingspatio-temporal,
author = {Marios Hadjieleftheriou and George Kollios and Vassilis J. Tsotras and Dimitrios Gunopulos},
title = { Indexing Spatio-temporal Archives},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Spatio-temporal objects — that is, objects that evolve over time — appear in many applications. Due to the nature of such applications, storing the evolution of objects through time in order to answer historical queries (queries that refer to past states of the evolution) requires a very large specialized database, what is termed in this article as a spatio-temporal archive. Efficient processing of historical queries on spatio-temporal archives requires equally sophisticated indexing schemes. Typical spatio-temporal indexing techniques represent the objects using minimum bounding regions (MBR) extended with a temporal dimension, which are then indexed using traditional multi-dimensional index structures. However, rough MBR approximations introduce excessive overlap between index nodes which deteriorates query performance. This article introduces a robust indexing scheme for answering spatio-temporal queries more efficiently. A number of algorithms and heuristics are elaborated, which can be used to preprocess a spatiotemporal archive in order to produce finer object approximations which, in combination with a multi-version index structure, will greatly improve query performance in comparison to the straightforward approaches. The proposed techniques introduce a query-efficiency vs. space tradeoff, that can help tune a structure according to available resources. Empirical observations for estimating the necessary amount of additional storage space required for improving query performance by a given factor are also provided. Moreover, heuristics for applying the proposed ideas in an online setting are discussed. Finally, a thorough experimental evaluation is conducted to show the merits of the proposed techniques.
Keyphrases
spatio-temporal archive query performance historical query many application finer object approximation multi-version index structure large specialized database temporal dimension spatiotemporal archive space tradeoff online setting index node typical spatio-temporal indexing technique necessary amount excessive overlap efficient processing spatio-temporal object minimum bounding region traditional multi-dimensional index structure empirical observation available resource robust indexing scheme query-efficiency v spatio-temporal query rough mbr approximation additional storage space thorough experimental evaluation
