首页 | 本学科首页   官方微博 | 高级检索  
     

最佳路径的层次编码及查询算法
引用本文:吴京,景宁,陈宏盛.最佳路径的层次编码及查询算法[J].计算机学报,2000,23(2):184-189.
作者姓名:吴京  景宁  陈宏盛
作者单位:国防科技大学电子工程学院,长沙,410073
摘    要:有效的路径查询处理是地理信息系统、系统及计算机网络等高级应用中的一个关键需求,文研究如交通网络和通信网络等节点发大的网络中的最佳路径查询算法,为了保证最佳路径查询的响应时间,采用定例化最佳路径视图的熏 预先计算和存储最佳路径,文中提出了HEPV(Hierarchical Encoded Path Viwe)结构,证明在HFEPV上进行路径查询最佳性,同时给出了相庆的最佳路径查询算法。

关 键 词:路径查询  最佳路径  算法  交通网  通信网
修稿时间:1998-11-16

Hierarchical Encoding of Optimal Path and Its Retrieval
WU Jing,JING Ning,CHEN Hong-Sheng.Hierarchical Encoding of Optimal Path and Its Retrieval[J].Chinese Journal of Computers,2000,23(2):184-189.
Authors:WU Jing  JING Ning  CHEN Hong-Sheng
Abstract:Efficient path query processing is a key requirement for advanced applications including GIS (Geographic Information Systems), navigation systems, and computer networks. The author investigates the best path query algorithm in the context of networks with large number of nodes and links, such as transportation networks and computer networks. To guarantee efficient response for best path queries, this paper employs a path view materialization strategy for pre computing and store the best paths, proposes the HEPV (Hierarchical Encoded Path View) approach, gives the optimality theorem of path retrieval over HEPV, as well as proposes best path retrieval algorithm.
Keywords:path query  best path  path view  hierarchical graph model
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号