Efficient mutual nearest neighbor query processing for moving object trajectories

Yunjun Gao, Baihua Zheng, Gencai Chen, Qing Li, Chun Chen, Gang Chen
<span title="">2010</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ozlq63ehnjeqxf6cuxxn27cqra" style="color: black;">Information Sciences</a> </i> &nbsp;
Given a set D of trajectories, a query object q, and a query time extent C, a mutual (i.e., symmetric) nearest neighbor (MNN) query over trajectories finds from D, the set of trajectories that are among the k 1 nearest neighbors (NNs) of q within C, and meanwhile, have q as one of their k 2 NNs. This type of queries is useful in many applications such as decision making, data mining, and pattern recognition, as it considers both the proximity of the trajectories to q and the proximity of q to
more &raquo; ... e trajectories. In this paper, we first formalize MNN search and identify its characteristics, and then develop several algorithms for processing MNN queries efficiently. In particular, we investigate two classes of MNN queries, i.e., MNN P and MNN T queries, which are defined with respect to stationary query points and moving query trajectories, respectively. Our methods utilize the batch processing and reusing technology to reduce the I/O cost (i.e., number of node/page accesses) and CPU time significantly. In addition, we extend our techniques to tackle historical continuous MNN (HCMNN) search for moving object trajectories, which returns the mutual nearest neighbors of q (for a specified k 1 and k 2 ) at any time instance of C. Extensive experiments with real and synthetic datasets demonstrate the performance of our proposed algorithms in terms of efficiency and scalability. Ó 2010 Elsevier Inc. All rights reserved. A preliminary version of this work has been published in the Proceedings of the 9th International Conference on Mobile Data Management (MDM 2008). Substantial new technical materials have been added to this journal submission. Specifically, the paper extends the MDM 2008 paper by mainly including (i) processing of the HCMNN query with respect to stationary query points, called HCMNN P retrieval (Section 5), (ii) processing of the HCMNN query with respect to moving query trajectories, called HCMNN T search (Section 5), and (iii) enhanced experimental evaluation that incorporates the new classes of queries (Section 6). Notes: (i) This manuscript is the authors' original work and has not been published nor has it been submitted simultaneously elsewhere, except for the preliminary version (i.e., [14] ) mentioned previously; (ii) The main differences between the conference version and this submission are stated above; and (iii) All authors have checked the manuscript and have agreed to the submission.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ins.2010.02.010">doi:10.1016/j.ins.2010.02.010</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rdg3hpwcbrhjpnb2x43qje6n24">fatcat:rdg3hpwcbrhjpnb2x43qje6n24</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200318145823/https://ink.library.smu.edu.sg/cgi/viewcontent.cgi?referer=&amp;httpsredir=1&amp;article=2985&amp;context=sis_research" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b9/dd/b9dd6cbbff174d3479c4f87b3086f798dbfff1cd.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ins.2010.02.010"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>