Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Main Memory Evaluation of Monitoring Queries Over Moving Objects

Main Memory Evaluation of Monitoring Queries Over Moving Objects 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Distributed and Parallel Databases Springer Journals

Main Memory Evaluation of Monitoring Queries Over Moving Objects

Loading next page...
 
/lp/springer-journals/main-memory-evaluation-of-monitoring-queries-over-moving-objects-QK80i7MHq2

References (36)

Publisher
Springer Journals
Copyright
Copyright © 2004 by Kluwer Academic Publishers
Subject
Computer Science; Processor Architectures; Computer Communication Networks; Data Structures, Cryptology and Information Theory; Information Storage and Retrieval
ISSN
0926-8782
eISSN
1573-7578
DOI
10.1023/B:DAPD.0000013068.25976.88
Publisher site
See Article on Publisher Site

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.

Journal

Distributed and Parallel DatabasesSpringer Journals

Published: Oct 18, 2004

There are no references for this article.