一句话：提出 TrieJax 架构，面向图模式匹配并将其映射到高效关系连接算法。
论文关注图模式匹配（例如查找所有环和团）在社交网络、生物信息学和网络安全等领域中的重要作用。近年来，数据库社区表明图模式匹配问题可以映射到一类高效的新型关系连接算法。标题表明作者提出了 TrieJax 架构，可能围绕这一映射设计专用架构或执行机制，以支撑图模式匹配类负载。然而，给出的英文摘要只交代了问题背景和关系连接算法这一视角，并未展开 TrieJax 的具体方法、实现细节或实验结果；因此其关键结果需要查阅正文。
Graph pattern matching (e.g., finding all cycles and cliques) has become an important component in domains such as social networks, biology and cyber-security. In recent years, the database community has shown that graph pattern matching problems can be mapped to an efficient new class of relational join algorithms.
DOI 原文 ·
@inproceedings{paperbot5414,
title = {The TrieJax Architecture},
author = {Oren Kalinsky and Benny Kimelfeld and Yoav Etsion},
booktitle = {ASPLOS},
year = {2020},
doi = {10.1145/3373376.3378524}
}