Transitive Nearest Neighbor Search in Mobile Environments
Conference Proceeding Article
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.
Databases and Information Systems | Numerical Analysis and Scientific Computing
Data Management and Analytics
IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (SUTC'06)
ZHENG, Baihua; LEE, Ken C. K.; and LEE, Wang-Chien.
Transitive Nearest Neighbor Search in Mobile Environments. (2007). IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (SUTC'06). 14-21. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/527