Efficient KNN processing over moving objects with uncertain velocity

Yuan Ko Huang, Chao Chun Chen, Chiang Lee

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

Abstract

Spatio-temporal databases aim at combining the spatial and temporal characteristics of data. The continuous K-Nearest Neighbor (CKNN) query is an important type of spatiotemporal query that finds the K-Nearest Neighbors (KNNs) of a moving query object at each time instant within a given time interval [ts, te]. In this paper, we investigate how to process a CKNN query efficiently under the situation that each object moves with an uncertain velocity. This uncertainty on the velocity of each object inevitably results in high complexity of the CKNN problem. We propose a cost-effective PKNN algorithm to tackle the complicated problem incurred by this uncertainty.

Original languageEnglish
Title of host publicationProceedings of the 15th ACM International Symposium on Advances in Geographic Information Systems, GIS 2007
Pages419-422
Number of pages4
DOIs
Publication statusPublished - 2007
Event15th ACM International Symposium on Advances in Geographic Information Systems, GIS 2007 - Seattle, WA, United States
Duration: 2007 Nov 72007 Nov 9

Publication series

NameGIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems

Other

Other15th ACM International Symposium on Advances in Geographic Information Systems, GIS 2007
Country/TerritoryUnited States
CitySeattle, WA
Period07-11-0707-11-09

All Science Journal Classification (ASJC) codes

  • Earth-Surface Processes
  • Computer Science Applications
  • Modelling and Simulation
  • Computer Graphics and Computer-Aided Design
  • Information Systems

Fingerprint

Dive into the research topics of 'Efficient KNN processing over moving objects with uncertain velocity'. Together they form a unique fingerprint.

Cite this