Range and kNN query processing for moving objects in Grid model

Hae Don Chon, Divyakant Agrawal, Amr El Abbadi

Research output: Contribution to journalArticle

33 Citations (Scopus)


With the growing popularity of mobile computing devices and wireless communications, managing dynamically changing information about moving objects is becoming feasible. In this paper, we implement a system that manages such information and propose two query algorithms: a range query algorithm and a k nearest neighbor algorithm. The range query algorithm is combined with an efficient filtering technique which determines if a polyline corresponding to the trajectory of a moving object intersects with a given range. We study the performance of the system, which shows that despite the filtering step, for moderately large ranges, the range query algorithm we propose outperforms the algorithm without filtering.

Original languageEnglish
Pages (from-to)401-412
Number of pages12
JournalMobile Networks and Applications
Issue number4
Publication statusPublished - 1 Aug 2003



  • K nearest neighbors query
  • Moving objects
  • Range query

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this