Revisiting the kNN Search Protocols on Road Networks in Data Broadcasting Environments

• Main Authors: Chang Chung-Wei, 張中維
• Other Authors: 劉傳銘
• Format: Others
• Language: zh-TW
• Online Access: http://ndltd.ncl.edu.tw/handle/z2kr68

碩士 === 國立臺北科技大學 === 資訊工程系研究所 === 104 === Providing a location-based system which can serve lots of query at once is a important issue in nowadays. Broadcast environment can greatly reduce server’s burden in bandwidth and computation. As a result, there are plenty of research discussing location-based system in broadcast environments. In the other hand, kNN search in road networks is one of the most popular query in numerous of location-based service since kNN search allows user to quick access nearby geographic information. Due to reasons above, this paper focus on discussing kNN search in road networks on broadcast environments and propose a fast and effective broadcasting protocol to resolve. In the server side, we first use grid partition to divide the whole road network into few regions and precompute nearest neighbor of each border node in its located region then add the information into index; In the client side, we observed a property in road network that every path that across multiple regions must pass through border nodes, according to this observation, we proposed a corresponding protocol to receive index, which could precisely prune unnecessary regions, and process kNN search efficiently. To prove the feasibility of the proposed method, we use real road network as material to experiment performance of our method and compare with other methods. Experiment result shows that our method will have better tuning time and latency in higher partitioning region number.