Incremental distance join algorithms for spatial databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Queries with segments in Voronoi diagrams
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
K-Nearest Neighbor Search for Moving Query Point
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
ACM Transactions on Database Systems (TODS)
An Efficient Technique for Nearest-Neighbor Query Processing on the SPY-TEC
IEEE Transactions on Knowledge and Data Engineering
Adaptive and Incremental Processing for Distance Join Queries
IEEE Transactions on Knowledge and Data Engineering
Continuous nearest neighbor search
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Continuous k-nearest neighbor search under mobile environment
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Forecasting region search of moving objects
KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I
Hi-index | 0.00 |
In this paper, we focus on a typical situation of LBS which is to provide services for users in cars that move in a road network. For such kind of users, the problem of k-CNN search along a specific route on road network is to find out k nearest neighbor (k-NN) objects for any place on the route. k nearest neighbors are selected based on the path length from the route to the objects, and the continuous search for all the points on the route should be considered. A k-CNN search method is proposed by using an incremental k-NN search based on road network.