计算机科学 ›› 2009, Vol. 36 ›› Issue (9): 151-153.

• 软件工程与数据库技术 • 上一篇    下一篇

一种新的道路网络连续查询处理方法

廖巍,吴晓平,严承华,钟志农   

  1. (海军工程大学电子工程学院 武汉 430033);(国防科技大学电子科学与工程学院 长沙 410093)
  • 出版日期:2018-11-16 发布日期:2018-11-16
  • 基金资助:
    本文国家863基金项目(2007AA12Z208) ,中国博士后科学基金资助项目(20080431384)资助。

Novel Method for Continuous Queries Processing in Road Networks

LIAO Wei , WU Xiao-ping, YAN Cheng-hua, ZHONG Zhi-nong   

  • Online:2018-11-16 Published:2018-11-16

摘要: 基于道路网络的连续k近部查询是移动对象数据库领域的研究重点和热点。提出了一种新的道路网络有向图模型,通过引入有向网络空间度量,利用基于内存的格网索引和线性链表结构来对移动对象当前位置和道路网络有向图模型进行存储和管理;基于有向距离度量提出了单向网络扩展(DNE)算法,以减少连续k近邻查询的网络扩展搜索代价。实验结果表明,DNE算法性能优于现有的连续k近部查询处理算法。

关键词: 连续k近部查询,道路网络,有向图模型,DNE算法

Abstract: CKNN (Continuous k-Nearest Neighbor) queries in road networks have recently received many attentions in moving objects databases. In this paper,we presented a novel road networks directional graph model and use memory-resident grid cell structure and linear list structures to store the moving objects and road network directional model. By introducing directional network distance measurement we proposed the directional network expansion (DNE) algorithm to reduce the network searching cost of CKNN ctueries processing. Experimental results show that the DNE algorithm outperforms existing algorithms.

Key words: CKNN queries,Road networks,Directional graph model,DNE algorithm

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!