Algorithms for Constrained k-Nearest Neighbor Queries over Moving Object Trajectories
An important query for spatio-temporal databases is to find nearest trajectories of moving objects. Existing work on this topic focuses on the closest trajectories in the whole data space. In this paper, we introduce and solve constrained k-nearest neighbor (CkNN) queries and historical continuous C...
Saved in:
Main Authors: | GAO, Yunjun, ZHENG, Baihua, CHEN, Gencai, LI, Qing, CHEN, Chun |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2010
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/1984 https://ink.library.smu.edu.sg/context/sis_research/article/2983/viewcontent/ZhengBH_2010_AlgorithmsConstrainedk_NearestNeighborQueriesMoving.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Efficient Mutual Nearest Neighbor Query Processing for Moving Object Trajectories
by: GAO, Yunjun, et al.
Published: (2010) -
On Efficient Mutual Nearest Neighbor Query Processing in Spatial Databases
by: GAO, Yunjun, et al.
Published: (2009) -
Visible Reverse k-Nearest Neighbor Query Processing in Spatial Databases
by: GAO, Yunjun, et al.
Published: (2009) -
Continuous Obstructed Nearest Neighbor Queries in Spatial Databases
by: GAO, Yunjun, et al.
Published: (2009) -
Continuous Visible Nearest Neighbor Query Processing in Spatial Databases
by: GAO, Yunjun, et al.
Published: (2011)