SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Power management techniques for mobile communication
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Data Management in Location-Dependent Information Services
IEEE Pervasive Computing
Data on Air: Organization and Access
IEEE Transactions on Knowledge and Data Engineering
Optimizing Index Allocation for Sequential Data Broadcasting in Wireless Mobile Computing
IEEE Transactions on Knowledge and Data Engineering
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
Using Predeclaration for Efficient Read-Only Transaction Processing in Wireless Data Broadcast
IEEE Transactions on Knowledge and Data Engineering
Energy efficient exact kNN search in wireless broadcast environments
Proceedings of the 12th annual ACM international workshop on Geographic information systems
The D-Tree: An Index Structure for Planar Point Queries in Location-Based Wireless Services
IEEE Transactions on Knowledge and Data Engineering
Spatial queries in wireless broadcast systems
Wireless Networks - Special issue: Pervasive computing and communications
A generic framework for monitoring continuous spatial queries over moving objects
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
DSI: A Fully Distributed Spatial Index for Location-Based Wireless Broadcast Services
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
| Hi-index | 0.00 |
It is observed, surprisingly, that existing nearest neighbor search methods may not work well 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 in wireless data broadcast. In the proposed scheme, a mobile client performs the nearest neighbor search in memory-efficient manner by making a sequential access to index packets according to their broadcast order over a wireless channel. The performance evaluation demonstrates that our approach outperforms existing ones considerably in terms of access time without compromising tuning time.