助记符:流图的并行子图匹配系统
Mnemonic: A Parallel Subgraph Matching System for Streaming Graphs
摘要:
在大型高度连接的数据集中发现模式对于业务开发和科学研究中的价值发现至关重要。这项工作的重点是子图匹配流图的问题,它提供了无数的现实世界中的应用程序,从社会网络分析网络安全的效用。每个应用程序都有一组不同的控制参数,包括对匹配、数据流类型和搜索粒度的限制。现有子图匹配系统的问题驱动设计使得它们很难应用于不同的问题域。本文介绍了助记符,一个可编程的系统,提供了一个高层次的API和民主化的各种各样的子图匹配解决方案的发展。重要的是,助记符还提供了关键的数据管理功能和优化,以支持对长时间运行的高速多关系图流的实时处理。实验证明了记忆术的多功能性,因为它比几个最先进的系统高出两个数量级。
英文摘要:
Finding patterns in large highly connected datasets is critical for value discovery in business development and scientific research. This work focuses on the problem of subgraph matching on streaming graphs, which provides utility in a myriad of real-world applications ranging from social network analysis to cybersecurity. Each application poses a different set of control parameters, including the restrictions for a match, type of data stream, and search granularity. The problem-driven design of existing subgraph matching systems makes them challenging to apply for different problem domains. This paper presents Mnemonic, a programmable system that provides a high-level API and democratizes the development of a wide variety of subgraph matching solutions. Importantly, Mnemonic also delivers key data management capabilities and optimizations to support real-time processing on long-running, high-velocity multi-relational graph streams. The experiments demonstrate the versatility of Mnemonic, as it outperforms several state-of-the-art systems by up to two orders of magnitude.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。