.png){kind=icon}
返回
Efficient reachability queries in multi-relation graph: An index-based approach
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compeleceng.2021.107469.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The reachability query is a fundamental problem in graph analysis. Most existing studies assume there is no or only one type of relation on the edges. To fill the gap, we propose two new reachability problems in multi-relation graphs. Specifically, given a multi-relation graph G, two vertices u, v, and a query relation set C, it aims to check whether u can reach v under the necessity/existence relation constraint. A baseline online reachability query framework firstly is proposed by extending the BFS method. To accelerate the processing, index-based methods are developed based on 2-hop cover framework. Moreover, several optimized strategies are developed to improve the efficiency of index construction. Extensive experiments are conducted to demonstrate the advantages of developed techniques. As shown, the optimized method can achieve up to 3X acceleration for index construction and the index-based strategy can achieve up to 36X speedup compared with the baseline for query processing.
Keyword:
Reachability query
Multi-relation graph
Index construction
Database system
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.9
论文数:
6.7K
被引数:
1.3W
机构
引用论文
X-ray Structure of Cerulean GFP: A Tryptophan-Based Chromophore Useful for Fluorescence Lifetime Imaging,.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏MANAGEMENT CONSIDERATIONS IN THE SURGICAL SETTING OF SUSPECTED AQUIRED FACTOR DEFICIENCIES疑似获得性因子缺乏症的外科处理管理考量
PREAI
分享收藏
查看更多内容