Processing Mutual Nearest Neighbor Queries for Moving Object Trajectories
Given a set of trajectories D, a query object (point or trajectory) q, and a query interval T, a mutual (i.e., symmetric) nearest neighbor (MNN) query over trajectories finds from D within T, the set of trajectories that are among the k1 nearest neighbors (NNs) of q, and meanwhile, have q as one of...
Saved in:
Main Authors: | GAO, Yunjun, CHEN, Gencai, LI, Qing, ZHENG, Baihua, LI, Chun |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2008
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/310 |
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) -
Algorithms for Constrained k-Nearest Neighbor Queries over 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 Queries
by: GAO, Yunjun, et al.
Published: (2009) -
Continuous Visible Nearest Neighbor Query Processing in Spatial Databases
by: GAO, Yunjun, et al.
Published: (2011)