Abstract
Query Processing for Moving Objects with Space-Time Grid Storage Model
by: Hae Don Chon, Divyakant Agrawal, Amr El Abbadi
Abstract:
With growing popularity of mobile computing devices and wirelesscommunications, managing dynamically changing information about moving objectsis becoming feasible.In this paper, we implement a system that manages such information andpropose two new algorithms. One is an efficient range query algorithmwith a filtering step which efficiently determines ifa polyline corresponding to the trajectory of a moving object intersectswith a given range. The other is a nearest neighbor query algorithm.We study the performance of the system, which shows that despite the filteringstep, for moderately large ranges, the range query algorithm we proposeoutperforms the algorithm without filtering.
Keywords:
moving object, range query, k nearest neighbor query
Date:
September 2001
Document: 2001-15
