GraphMatch:基于FPGA的子图查询处理
GraphMatch: Subgraph Query Processing on FPGAs
AI总结:
本文提出GraphMatch,首个基于最坏情况最优连接、专为FPGA设计的通用子图查询处理加速器,通过AllCompare集合交集方法实现高效子图嵌入查询,相比GraphFlow和RapidMatch分别加速2.68倍和5.16倍。
摘要:
在大图中高效查找子图嵌入对于生物学和社交网络分析等许多应用领域至关重要。集合交集是当前基于连接的CPU子图查询处理系统中最主要且最具挑战性的方面。先前的工作已经证明了利用FPGA加速图和连接处理的可行性。在这项工作中,我们提出了GraphMatch,这是第一个基于最坏情况最优连接(WCOJ)的通用独立子图查询处理加速器,完全为现代现场可编程门阵列(FPGA)硬件设计。为了高效处理各种图数据集和查询图模式,它利用了一种新颖的集合交集方法,称为AllCompare,专为FPGA量身定制。我们表明,这种集合交集方法能高效解决子图查询处理中的多集合交集问题,优于基于CPU的方法。总体而言,与最先进的系统GraphFlow和RapidMatch相比,GraphMatch分别实现了超过2.68倍和5.16倍的加速。
英文摘要:
Efficiently finding subgraph embeddings in large graphs is crucial for many application areas like biology and social network analysis. Set intersections are the predominant and most challenging aspect of current join-based subgraph query processing systems for CPUs. Previous work has shown the viability of utilizing FPGAs for acceleration of graph and join processing. In this work, we propose GraphMatch, the first genearl-purpose stand-alone subgraph query processing accelerator based on worst-case optimal joins (WCOJ) that is fully designed for modern, field programmable gate array (FPGA) hardware. For efficient processing of various graph data sets and query graph patterns, it leverages a novel set intersection approach, called AllCompare, tailor-made for FPGAs. We show that this set intersection approach efficiently solves multi-set intersections in subgraph query processing, superior to CPU-based approaches. Overall, GraphMatch achieves a speedup of over 2.68x and 5.16x, compared to the state-of-the-art systems GraphFlow and RapidMatch, respectively.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。