Transitive Nearest Neighbor Search in Mobile Environments

• Main Authors: ZHENG, Baihua, LEE, Ken C. K., LEE, Wang-Chien
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2007
• Subjects: Databases and Information Systems; Numerical Analysis and Scientific Computing
• Online Access: https://ink.library.smu.edu.sg/sis_research/527; http://dx.doi.org/10.1109/SUTC.2006.138
• Institution: Singapore Management University

Given a query point p, typically the position of a current client, and two datasets S and R, a transitive nearest neighbor (TNN) search returns a pair of objects (s, r) E¸ S x R such that the total distance from p to s and then to r, i.e., dis(p, s) + dis(s, r), is minimum. We propose various algorithms for supporting TNN search as a kind of locationbased services in both on-demand-based and broadcastbased mobile environments. In addition, we develop a novel validation algorithm that allows the clients to verify whether their TNN query answers are still valid after they moved to new positions. Finally, we conduct a comprehensive simulation to evaluate performance of the proposed TNN search algorithms.