高技术通讯2017，Vol.27Issue(11)：899-906,8.DOI:10.3772/j.issn.1002-0470.2017.11-12.003
基于顶点关联索引的最短路径查询算法研究
Research on a shortest path query algorithm based on vertex-related index
摘要
Abstract
The shortest path query problem in graph query is studied.Aiming at existing algorithms' problem of low efficiency and expansibility caused by the long time of the construction of index and the large scale of indexes, a vertex-related index strategy is proposed in index construction:constructing a vertex-related index on the vertex of 1, constructing a 2-hop tag index for other vertices, reducing the index size by reducing the number of traversal times of redundant data storage and graphs to reduce the build index time.Based on the proposed query strategy, the shortest path query algorithm based on vertex-related index and 2-hop tag is given.关键词
图模型/最短路径查询/顶点关联索引/2-hop标签索引Key words
graphical model/shortest path query/vertex-related index/2-hop label index引用本文复制引用
余靖,杨清章..基于顶点关联索引的最短路径查询算法研究[J].高技术通讯,2017,27(11):899-906,8.基金项目
国家自然科学基金(61572421)资助项目. （61572421）
