earticle

논문검색

Continuous Reverse k-Nearest-Neighbor Query in Dynamic Road Network

원문정보

초록

영어

Traditional location-based query measures the distance of all data points in various methods, but it is not applicable for the condition in which the weight of all sections in the road network are altered dynamically. In order to solve the new application problems brought by the real-time traffic status, a dynamic monitoring algorithm is designed in this paper, and it mainly updates the weight changes of road network with temporary network extension tree incrementally. On this basis, a continuous reverse K-nearest-neighbor (RKNN) query method is proposed, and it is proved to be efficient by the experimental results.

목차

Abstract
 1. Introduction
 2. Relevant Work
 3. Relevant Definition
 4. CRKN Query of Dynamic Weight
  4.1 Initial Stage of Query
  4.2 Mobile Stage
  4.3 Weight Change Incremental Updating Stage
 5. Experimental Results and Analysis
 6. Conclusion
 Acknowledgements
 References

저자정보

  • Chen Wen School of Mathematics and Computer Science, Tongling College, Tongling, P.R.China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.