DMCA
Efficient evaluation of continuous range queries on moving objects (2002)
| Venue: | In DEXA 2002, Proc. of the 13th International Conference and Workshop on Database and Expert Systems Applications, Aix en Provence |
| Citations: | 38 - 11 self |
BibTeX
@INPROCEEDINGS{Kalashnikov02efficientevaluation,
author = {Dmitri V. Kalashnikov and Sunil Prabhakar and Susanne E. Hambrusch},
title = {Efficient evaluation of continuous range queries on moving objects},
booktitle = {In DEXA 2002, Proc. of the 13th International Conference and Workshop on Database and Expert Systems Applications, Aix en Provence},
year = {2002},
pages = {731--740}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In this paper we evaluate several in-memory algorithms for efficient and scalable processing of continuous range queries over collections of moving objects. Constant updates to the index are avoided by query indexing. No constraints are imposed on the speed or path of moving objects or fraction of objects that move at any moment in time. We present a detailed analysis of a grid approach which shows the best results for both skewed and uniform data. A sorting based optimization is developed for significantly improving the cache hit-rate. Experimental evaluation establishes that indexing queries using the grid index yields orders of magnitude better performance than other index structures such as R*-trees. 1
