SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
The SR-tree: an index structure for high-dimensional nearest neighbor queries
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Optimal multi-step k-nearest neighbor search
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Data on Air: Organization and Access
IEEE Transactions on Knowledge and Data Engineering
Approximate Nearest Neighbor Searching in Multimedia Databases
Proceedings of the 17th International Conference on Data Engineering
Evaluating Top-k Selection Queries
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Fast Nearest Neighbor Search in Medical Image Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Efficient k Nearest Neighbor Queries on Remote Spatial Databases Using Range Estimation
SSDBM '02 Proceedings of the 14th International Conference on Scientific and Statistical Database Management
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
Power Conservative Multi-Attribute Queries on Data Broadcast
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Nearest neighbor queries in road networks
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
Computational data modeling for network-constrained moving objects
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
Energy efficient exact kNN search in wireless broadcast environments
Proceedings of the 12th annual ACM international workshop on Geographic information systems
Efficient data dissemination using locale covers
Proceedings of the 14th ACM international conference on Information and knowledge management
Adaptive data dissemination schemes for location-aware mobile services
Journal of Systems and Software - Special issue: Quality software
Efficient data dissemination using locale covers
Pervasive and Mobile Computing
On processing location based top-k queries in the wireless broadcasting system
Proceedings of the 2010 ACM Symposium on Applied Computing
Energy-efficient shortest path query processing on air
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Effective low-latency k-nearest neighbor search via wireless data broadcast
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Processing generalized k-nearest neighbor queries on a wireless broadcast stream
Information Sciences: an International Journal
Spatial queries in wireless broadcast environments
MobiDE '12 Proceedings of the Eleventh ACM International Workshop on Data Engineering for Wireless and Mobile Access
| Hi-index | 0.00 |
While the K-Nearest-Neighbor (KNN) problem is well studied in the traditional wired, disk-based client-server environment, it has not been tackled in a wireless broadcast environment. In this paper, the problem of organizing location dependent data and answering KNN queries on air are investigated. The linear property of wireless broadcast media and power conserving requirement of mobile devices make this problem particularly interesting and challenging. An efficient data organization, called sorted list, and the corresponding search algorithm are proposed and compared with the well-known spatial index, R-Tree. In addition, we develop an approximate search scope to guide the search at the very beginning of the search process and a learning algorithm to adapt the search scope during the search to improve energy and access efficiency. Simulation based performance evaluation is conducted to compare sorted list and R-Tree. The results show that the utilization of search scope and learning algorithm improves search efficiency of both index mechanisms significantly. While R-Tree is more power efficient when a large number of nearest neighbors is requested, the sorted list has better access efficiency and less power consumption when the number of nearest neighbors is small.