On Efficient Mutual Nearest Neighbor Query Processing in Spatial Databases
This paper studies a new form of nearest neighbor queries in spatial databases, namely, mutual nearest neighbour (MNN) search. Given a set D of objects and a query object q, an MNN query returns from D, the set of objects that are among the k1 (≥ 1) nearest neighbors (NNs) of q; meanwhile, have q as one of their k2(≥ 1) NNs. Although MNN queries are useful in many applications involving decision making, data mining, and pattern recognition, it cannot be efficiently handled by existing spatial query processing approaches. In this paper, we present the first piece of work for tackling MNN queries efficiently. Our methods utilize a conventional data-partitioning index (e.g., R-tree, etc.) on the dataset, employ the state-of-the-art database techniques including best-first based k nearest neighbor (kNN) retrieval and reverse kNN search with TPL pruning, and make use of the advantages of batch processing and reusing technique. An extensive empirical study, based on experiments performed using both real and synthetic datasets, has been conducted to demonstrate the efficiency and effectiveness of our proposed algorithms under various experimental settings.
Query processing, Nearest neighbor, Spatial databases, Algorithm
Databases and Information Systems | Numerical Analysis and Scientific Computing
Data Management and Analytics
Data and Knowledge Engineering
GAO, Yunjun; ZHENG, Baihua; CHEN, Gencai; and LI, Qing.
On Efficient Mutual Nearest Neighbor Query Processing in Spatial Databases. (2009). Data and Knowledge Engineering. 68, (8), 705-727. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/788
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.
This document is currently not available here.