Constrained k-nearest neighbor query processing over moving object trajectories

Yunjun Gao, Gencai Chen, Qing Li, Chun Li, Chun Chen

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

4 Citations (Scopus)


Given a set D of trajectories, a query object (point or trajectory) q, a time interval T, and a constrained region CR, a constrained k-nearest neighbor (CkNN) query over moving object trajectories retrieves from D within T, the k ( 1) trajectories that lie closest to q and intersect (or are enclosed by) CR. In this paper, we propose several algorithms for efficiently processing CkNN search on moving object trajectories. In particular, we thoroughly investigate two types of CkNN queries, viz. CkNNP and CkNNT queries, which are defined w.r.t. stationary query points and moving query trajectories, respectively. The performance of our algorithms is evaluated with extensive experiments using both real and synthetic datasets.

Original languageEnglish
Title of host publicationDatabase Systems for Advanced Applications - 13th International Conference, DASFAA 2008, Proceedings
Number of pages9
Publication statusPublished - 21 Jul 2008
Externally publishedYes
Event13th International Conference on Database Systems for Advanced Applications, DASFAA 2008 - New Delhi, India
Duration: 19 Mar 200821 Mar 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4947 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference13th International Conference on Database Systems for Advanced Applications, DASFAA 2008
CityNew Delhi

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this