Query processing for moving objects with space-time grid storage model

Hae Don Chon, D. Agrawal, A. El Abbadi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

22 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 an efficient range query algorithm with a filtering step which efficiently 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
Title of host publicationProceedings - IEEE International Conference on Mobile Data Management
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages121-128
Number of pages8
Volume2002-January
ISBN (Print)0769515002
DOIs
Publication statusPublished - 2002
Externally publishedYes
Event3rd International Conference on Mobile Data Management, MDM 2002 - Singapore, Singapore
Duration: 8 Jan 200211 Jan 2002

Other

Other3rd International Conference on Mobile Data Management, MDM 2002
CountrySingapore
CitySingapore
Period8/1/0211/1/02

Fingerprint

Query processing
Mobile computing
Trajectories
Communication

Keywords

  • Computer science
  • Costs
  • Filtering algorithms
  • Information filtering
  • Information management
  • Mobile computing
  • Partitioning algorithms
  • Query processing
  • Vehicles
  • Wireless communication

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Chon, H. D., Agrawal, D., & El Abbadi, A. (2002). Query processing for moving objects with space-time grid storage model. In Proceedings - IEEE International Conference on Mobile Data Management (Vol. 2002-January, pp. 121-128). [994390] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/MDM.2002.994390

Query processing for moving objects with space-time grid storage model. / Chon, Hae Don; Agrawal, D.; El Abbadi, A.

Proceedings - IEEE International Conference on Mobile Data Management. Vol. 2002-January Institute of Electrical and Electronics Engineers Inc., 2002. p. 121-128 994390.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chon, HD, Agrawal, D & El Abbadi, A 2002, Query processing for moving objects with space-time grid storage model. in Proceedings - IEEE International Conference on Mobile Data Management. vol. 2002-January, 994390, Institute of Electrical and Electronics Engineers Inc., pp. 121-128, 3rd International Conference on Mobile Data Management, MDM 2002, Singapore, Singapore, 8/1/02. https://doi.org/10.1109/MDM.2002.994390
Chon HD, Agrawal D, El Abbadi A. Query processing for moving objects with space-time grid storage model. In Proceedings - IEEE International Conference on Mobile Data Management. Vol. 2002-January. Institute of Electrical and Electronics Engineers Inc. 2002. p. 121-128. 994390 https://doi.org/10.1109/MDM.2002.994390
Chon, Hae Don ; Agrawal, D. ; El Abbadi, A. / Query processing for moving objects with space-time grid storage model. Proceedings - IEEE International Conference on Mobile Data Management. Vol. 2002-January Institute of Electrical and Electronics Engineers Inc., 2002. pp. 121-128
@inproceedings{26d8ea20504d4a858fd6b93a61f5fdad,
title = "Query processing for moving objects with space-time grid storage 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 an efficient range query algorithm with a filtering step which efficiently 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 = "Computer science, Costs, Filtering algorithms, Information filtering, Information management, Mobile computing, Partitioning algorithms, Query processing, Vehicles, Wireless communication",
author = "Chon, {Hae Don} and D. Agrawal and {El Abbadi}, A.",
year = "2002",
doi = "10.1109/MDM.2002.994390",
language = "English",
isbn = "0769515002",
volume = "2002-January",
pages = "121--128",
booktitle = "Proceedings - IEEE International Conference on Mobile Data Management",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Query processing for moving objects with space-time grid storage model

AU - Chon, Hae Don

AU - Agrawal, D.

AU - El Abbadi, A.

PY - 2002

Y1 - 2002

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 an efficient range query algorithm with a filtering step which efficiently 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 an efficient range query algorithm with a filtering step which efficiently 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 - Computer science

KW - Costs

KW - Filtering algorithms

KW - Information filtering

KW - Information management

KW - Mobile computing

KW - Partitioning algorithms

KW - Query processing

KW - Vehicles

KW - Wireless communication

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

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

U2 - 10.1109/MDM.2002.994390

DO - 10.1109/MDM.2002.994390

M3 - Conference contribution

SN - 0769515002

VL - 2002-January

SP - 121

EP - 128

BT - Proceedings - IEEE International Conference on Mobile Data Management

PB - Institute of Electrical and Electronics Engineers Inc.

ER -