Evaluation of the Context-Free Path Querying Algorithm Based on Matrix Multiplication

Nikita Mishin,Iaroslav Sokolov,Egor Spirin,Vladimir Kutuev, Egor Nemchinov,Sergey Gorbatyuk,Semyon Grigorev

Proceedings of the 2nd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)（2019）

引用 5|浏览3

暂无评分

摘要

Recently proposed matrix multiplication based algorithm for context-free path querying (CFPQ) offloads the most performance-critical parts onto boolean matrices multiplication. Thus, it is possible to achieve high performance of CFPQ by means of modern parallel hardware and software. In this paper, we provide results of empirical performance comparison of different implementations of this algorithm on both real-world data and synthetic data for the worst cases.

查看译文

关键词

CUDA, Context-free path querying, GPGPU, boolean matrix, context-free grammar, graph databases, matrix multiplication, transitive closure

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要