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)

Abstract

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
Volume8
Issue number4
DOIs
Publication statusPublished - 1 Aug 2003
Externally publishedYes

Fingerprint

Query processing
Mobile computing
Trajectories
Communication

Keywords

  • K nearest neighbors query
  • Moving objects
  • Range query

ASJC Scopus subject areas

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

Cite this

Range and kNN query processing for moving objects in Grid model. / Chon, Hae Don; Agrawal, Divyakant; El Abbadi, Amr.

In: Mobile Networks and Applications, Vol. 8, No. 4, 01.08.2003, p. 401-412.

Research output: Contribution to journalArticle

Chon, Hae Don ; Agrawal, Divyakant ; El Abbadi, Amr. / Range and kNN query processing for moving objects in Grid model. In: Mobile Networks and Applications. 2003 ; Vol. 8, No. 4. pp. 401-412.
@article{8556dbbddf944b33ad680e0eefae8c9f,
title = "Range and kNN query processing for moving objects in Grid model",
abstract = "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.",
keywords = "K nearest neighbors query, Moving objects, Range query",
author = "Chon, {Hae Don} and Divyakant Agrawal and {El Abbadi}, Amr",
year = "2003",
month = "8",
day = "1",
doi = "10.1023/A:1024535730539",
language = "English",
volume = "8",
pages = "401--412",
journal = "Mobile Networks and Applications",
issn = "1383-469X",
publisher = "Springer Netherlands",
number = "4",

}

TY - JOUR

T1 - Range and kNN query processing for moving objects in Grid model

AU - Chon, Hae Don

AU - Agrawal, Divyakant

AU - El Abbadi, Amr

PY - 2003/8/1

Y1 - 2003/8/1

N2 - 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.

AB - 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.

KW - K nearest neighbors query

KW - Moving objects

KW - Range query

UR - http://www.scopus.com/inward/record.url?scp=0042196177&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0042196177&partnerID=8YFLogxK

U2 - 10.1023/A:1024535730539

DO - 10.1023/A:1024535730539

M3 - Article

VL - 8

SP - 401

EP - 412

JO - Mobile Networks and Applications

JF - Mobile Networks and Applications

SN - 1383-469X

IS - 4

ER -