| 注册
首页|期刊导航|计算机工程|动态权重路网下的连续近邻查询

动态权重路网下的连续近邻查询

吕卫锋 王飞 姜新新 诸彤宇

计算机工程2011,Vol.37Issue(19):157-159,3.
计算机工程2011,Vol.37Issue(19):157-159,3.DOI:10.3969/j.issn.1000-3428.2011.19.051

动态权重路网下的连续近邻查询

Continuous Nearest Neighbor Queries in Dynamic Weight Road Networks

吕卫锋 1王飞 1姜新新 1诸彤宇1

作者信息

  • 1. 北京航空航天大学软件开发环境国家重点实验室,北京100191
  • 折叠

摘要

Abstract

When continuous nearest neighbors query the targets which are close, they always find the same routes to the nearest neighbors all the time, which makes more and more users follow the same way, and causes a traffic jam. Aiming at the problem, this paper proposes a domination relationship monitoring algorithm. It uses real-time traffic information as the change weight, gives a novel form of continuous k nearest neighbor queries considering the large scale weight changes in road networks to avoid traffic jams. Experimental result shows the efficiency and effectiveness of the algorithm.

关键词

连续近邻查询/动态权重/支配关系/实时交通信息/路网

Key words

continuous nearest neighbor queries/ dynamic weight/ domination relationship/ real-time traffic information/ road networks

分类

信息技术与安全科学

引用本文复制引用

吕卫锋,王飞,姜新新,诸彤宇..动态权重路网下的连续近邻查询[J].计算机工程,2011,37(19):157-159,3.

基金项目

国家“973”计划基金资助项目(2005CB321903) (2005CB321903)

计算机工程

OACSCDCSTPCD

1000-3428

访问量0
|
下载量0
段落导航相关论文