| 注册
首页|期刊导航|桂林电子科技大学学报|基于双区间标签的大规模图可达性索引

基于双区间标签的大规模图可达性索引

李婷婷 古天龙

桂林电子科技大学学报2017,Vol.37Issue(4):302-306,5.
桂林电子科技大学学报2017,Vol.37Issue(4):302-306,5.

基于双区间标签的大规模图可达性索引

An reachability index for large-scale graph based on dual interval labeling

李婷婷 1古天龙1

作者信息

  • 1. 桂林电子科技大学 计算机与信息安全学院,广西 桂林 541004
  • 折叠

摘要

Abstract

For the high cost of reachability index of the large-scale graph,an index method based on dual interval labeling is proposed.Each node is assigned a main interval and an auxiliary interval by GIDIL.The two intervals are applied to store the reachability information of the original graph.The reachability information of the spanning tree is recorded by the main interval,and the reachability information of non-tree edge is recorded by the auxiliary interval.The reachability algorithm based on the index method is designed to effectively process the reachability query of graph.Experimental results show that the method can ensure reachability query performance,build the index more quickly and can be extended to large scale graph.

关键词

区间标签/可达性//索引

Key words

interval labeling/reachability/graph/index

分类

信息技术与安全科学

引用本文复制引用

李婷婷,古天龙..基于双区间标签的大规模图可达性索引[J].桂林电子科技大学学报,2017,37(4):302-306,5.

基金项目

广西自然科学基金(2016GXNSFDA380006) (2016GXNSFDA380006)

桂林电子科技大学学报

1673-808X

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