A collaborative approach to moving <mml:math altimg="si239.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd" xmlns:sa="http://www.elsevier.com/xml/common/struct-aff/dtd"><mml:mi>k</mml:mi></mml:math>-nearest neighbor queries in directed and dynamic road networks-Reference-Cited by-同舟云学术

A collaborative approach to moving k-nearest neighbor queries in directed and dynamic road networks

Author:

Cho Hyung-Ju,Jin Rize,Chung Tae-Sun

Funder

Ministry of Education

Publisher

Elsevier BV

Subject

Software,Computer Science Applications,Hardware and Architecture,Computer Networks and Communications,Information Systems

Reference36 articles.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

5. V-Tree: Efficient kNN Search on Moving Objects with Road-Network Constraints;2017 IEEE 33rd International Conference on Data Engineering (ICDE);2017-04