Efficient Mutual Nearest Neighbor Query Processing for Moving Object Trajectories

Given a set D of trajectories, a query object q, and a query time extent Γ, a mutual (i.e., symmetric) nearest neighbor (MNN) query over trajectories finds from D, the set of trajectories that are among the k1 nearest neighbors (NNs) of q within Γ, and meanwhile, have q as one of their k2 NNs. This...

Full description

Saved in:
Bibliographic Details
Main Authors: GAO, Yunjun, ZHENG, Baihua, CHEN, Gencai, LI, Qing, CHEN, Chun, CHEN, Gang
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2010
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/1986
https://ink.library.smu.edu.sg/context/sis_research/article/2985/viewcontent/Efficient_Mutual_Nearest_Neighbor_Query_Processing_for_Moving_Obj.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English