SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Indexing the Distance: An Efficient Method to KNN Processing
Proceedings of the 27th International Conference on Very Large Data Bases
Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects
IDEAS '02 Proceedings of the 2002 International Symposium on Database Engineering & Applications
The ANN-tree: An Index for Efficient Approximate Nearest Neighbor Search
DASFAA '01 Proceedings of the 7th International Conference on Database Systems for Advanced Applications
Fast Approximate Nearest-Neighbor Queries in Metric Feature Spaces by Buoy Indexing
VISUAL '02 Proceedings of the 5th International Conference on Recent Advances in Visual Information Systems
Nearest Neighbor Queries in a Mobile Environment
STDBM '99 Proceedings of the International Workshop on Spatio-Temporal Database Management
Spatial queries in dynamic environments
ACM Transactions on Database Systems (TODS)
Hi-index | 0.00 |
Recently, as growing of interest for LBS(location-based services) techniques, researches for NN(nearest neighbor) query which has often been used in LBS, are progressed variously. However, the results of conventional NN query processing techniques may be invalidated as the query and data objects move. To solve these problems, in this paper we propose a new nearest neighbor query processing technique, called CTNN, which is possible to meet continuous query processing for mobile objects. In order to evaluate the proposed techniques, we experimented with various datasets and experimental results showed that the proposed techniques can find accurately NN objects. The proposed techniques can be applied to navigation system, traffic control system, distribution information system, etc., and specially are most suitable when both data and query are mobile objects.