计算机工程2018，Vol.44Issue(3)：65-72,8.DOI:10.3969/j.issn.1000-3428.2018.03.011
面向大规模图数据的分布式可达性索引与查询策略
Distributed Accessibility Index and Query Strategy for Large-scale Graph Data
摘要
Abstract
Aiming at the problem of long construction time,high storage cost and long response time of reachability index of large graph,a Distributed Reachability Index and Query (DRIQ) strategy is proposed in this paper.Large graph is partitioned into several small subgraphs without destroying the reachability of the nodes.And reachability indexes are created for each subgraph distributed and parallel to improve the efficiency of index creating.Some methods are designed to keep the reachability of the nodes in the subgraphs and the reachability of the nodes between the subgraphs in DRIQ,which can ensure the correctness of the reachability query based on DRIQ.Experimental results show that the strategy is highly efficient and scalable,compared with the traditional reachability query method.关键词
大规模图数据/图划分/分布式/可达性索引/可达性查询Key words
large-scale graph data/graph partition/distributed/accessibility index/accessibility query分类
信息技术与安全科学引用本文复制引用
夏秀峰,张刘畅,刘向宇..面向大规模图数据的分布式可达性索引与查询策略[J].计算机工程,2018,44(3):65-72,8.基金项目
国家自然科学基金(61502316). （61502316）
