SCG '91 Proceedings of the seventh annual symposium on Computational geometry
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Enhanced nearest neighbour search on the R-tree
ACM SIGMOD Record
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Time-parameterized queries in spatio-temporal databases
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
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
Indexing the Solution Space: A New Technique for Nearest Neighbor Search in High-Dimensional Space
IEEE Transactions on Knowledge and Data Engineering
Modeling and Querying Moving Objects
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
STR: A Simple and Efficient Algorithm for R-Tree Packing
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Approximate Nearest Neighbor Searching in Multimedia Databases
Proceedings of the 17th International Conference on Data Engineering
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
What Is the Nearest Neighbor in High Dimensional Spaces?
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Contrast Plots and P-Sphere Trees: Space vs. Time in Nearest Neighbour Searches
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Indexing the Distance: An Efficient Method to KNN Processing
Proceedings of the 27th International Conference on Very Large Data Bases
Hilbert R-tree: An Improved R-tree using Fractals
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
K-Nearest Neighbor Search for Moving Query Point
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Fast Approximate Search Algorithm for Nearest Neighbor Queries in High Dimensions
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Power Conservative Multi-Attribute Queries on Data Broadcast
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Continuous nearest neighbor search
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
IEEE Transactions on Knowledge and Data Engineering
Dubious feedback: fair or not?
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
An effective kNN search protocol in wireless broadcast environments
Proceedings of the 2007 ACM symposium on Applied computing
Effective protocols for kNN search on broadcast multi-dimensional index trees
Information Systems
Proceedings of the 6th international conference on Mobile systems, applications, and services
Approximate Evaluation of Range Nearest Neighbor Queries with Quality Guarantee
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
A distributed spatial index for error-prone wireless data broadcast
The VLDB Journal — The International Journal on Very Large Data Bases
Probabilistic Granule-Based Inside and Nearest Neighbor Queries
ADBIS '09 Proceedings of the 13th East European Conference on Advances in Databases and Information Systems
Location-dependent query processing: Where we are and where we are heading
ACM Computing Surveys (CSUR)
A proxy based dynamic data management using hierarchical database for location based services
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
Middleware for reliable real-time sensor data management
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
Energy-efficient shortest path query processing on air
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Air-Indexing on error prone communication channels
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
Spatial queries in wireless broadcast environments
MobiDE '12 Proceedings of the Eleventh ACM International Workshop on Data Engineering for Wireless and Mobile Access
Spatial query processing in road networks for wireless data broadcast
Wireless Networks
UV-diagram: a voronoi diagram for uncertain spatial databases
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on the locations of data objects: using some distance heuristics on object locations. The latter is built on a precomputed solution space. Thus, NN queries can be reduced to and processed as simple point queries in this solution space. Both approaches exhibit some disadvantages, especially when employed for wireless data broadcast in mobile computing environments.In this paper, we introduce a new index method, called the grid-partition index, to support NN search in both on-demand access and periodic broadcast modes of mobile computing. The grid-partition index is constructed based on the Voronoi diagram, i.e., the solution space of NN queries. However, it has two distinctive characteristics. First, it divides the solution space into grid cells such that a query point can be efficiently mapped into a grid cell around which the nearest object is located. This significantly reduces the search space. Second, the grid-partition index stores the objects that are potential NNs of any query falling within the cell. The storage of objects, instead of the Voronoi cells, makes the grid-partition index a hybrid of the solution-based and object-based approaches. As a result, it achieves a much more compact representation than the pure solution-based approach and avoids backtracked traversals required in the typical object-based approach, thus realizing the advantages of both approaches.We develop an incremental construction algorithm to address the issue of object update. In addition, we present a cost model to approximate the search cost of different grid partitioning schemes. The performances of the grid-partition index and existing indexes are evaluated using both synthetic and real data. The results show that, overall, the grid-partition index significantly outperforms object-based indexes and solution-based indexes. Furthermore, we extend the grid-partition index to support continuous-nearest-neighbor search. Both algorithms and experimental results are presented.