Examining Impact of Sequential Access for Nearest Neighbor Search in Wireless Data Broadcast
スポンサーリンク
概要
- 論文の詳細を見る
It is observed, surprisingly, that existing nearest neighbor search methods in wireless data broadcast may not work effectively on mobile clients with very limited memory space. To resolve this problem, a novel method for nearest neighbor search is introduced in the context of a representative of indexes, the grid-partition index, in wireless data broadcast. In the proposed scheme, a mobile client performs the nearest neighbor search by making a sequential access to index packets according to their broadcast order over a wireless channel. The performance evaluation demonstrates that our approach substantially outperforms limited memory versions of existing methods in terms of access time, while retaining a good energy conservation.
- (社)電子情報通信学会の論文
- 2008-09-01
著者
-
LEE Myong-Soo
Department of Computer Science and Engineering, Korea University
-
LEE SangKeun
Department of Computer Science and Engineering, Korea University
-
Lee Sangkeun
Department Of Computer Science And Engineering Korea University
-
Lee Myong‐soo
Korea Univ. Seoul Kor
-
Lee Myong-soo
Department Of Computer Science And Engineering Korea University
関連論文
- XIR : Efficient Cache Invalidation Strategies for XML Data in Wireless Environments
- In-Network Processing for Skyline Queries in Sensor Networks(Ubiquitous Sensor Networks)
- Energy Conserving Multiple Data Access in Wireless Data Broadcast Environments(Broadcast Systems)
- Examining Impact of Sequential Access for Nearest Neighbor Search in Wireless Data Broadcast