Heuristic search in database systems
Proceedings from the first international workshop on Expert database systems
A Framework for Generating Network-Based Moving Objects
Geoinformatica
Nearest neighbor queries in road networks
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
Monitoring k-Nearest Neighbor Queries over Moving Objects
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
An efficient and scalable approach to CNN queries in a road network
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Continuous nearest neighbor monitoring in road networks
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Voronoi-based K nearest neighbor search for spatial network databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
CkNN query processing over moving objects with uncertain speeds in road networks
APWeb'11 Proceedings of the 13th Asia-Pacific web conference on Web technologies and applications
Approximate continuous K-nearest neighbor queries for uncertain objects in road networks
WAIM'11 Proceedings of the 12th international conference on Web-age information management
Ranking continuous nearest neighbors for uncertain trajectories
The VLDB Journal — The International Journal on Very Large Data Bases
Continuous distance-based skyline queries in road networks
Information Systems
Continuous min-max distance bounded query in road networks
APWeb'12 Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications
Searching continuous nearest neighbors in road networks on the air
Information Systems
Hi-index | 0.00 |
Continuous K -Nearest Neighbor (CK NN) query is an important type of spatio-temporal queries. A CK NN query is to find among all moving objects the K -nearest neighbors (K NNs) of a moving query object at each timestamp. In this paper, we focus on processing such a CK NN query in road networks, where the criterion for determining the K NNs is the shortest network distance between objects. We first highlight the limitations of the existing approaches, and then propose a cost-effective algorithm, namely the Continuous KNN algorithm , to overcome these limitations. Comprehensive experiments are conducted to demonstrate the efficiency of the proposed approach.