返回
Graph Pattern Matching: A Join/Semijoin Approach
DOI:10.1109/TKDE.2010.169.png)
摘要
En 中文
Due to rapid growth of the Internet and new scientific/technological advances, there exist many new applications that model data as graphs, because graphs have sufficient expressiveness to model complicated structures. The dominance of graphs in real-world applications demands new graph processing techniques to access large data graphs effectively and efficiently. In this paper, we study a graph pattern matching problem, which is to find all patterns in a large data graph that match a user-given graph pattern. We propose new two-step R-join (reachability join) algorithms with a filter step (R-semijoin) and a fetch step (R-join) by utilizing a new cluster-based join index with graph codes in a relational database context. We also propose two optimization approaches to further optimize sequences of R-joins/R-semijoins. The first approach is based on R-join order selection followed by R-semijoin enhancement, and the second approach is to interleave R-joins with R-semijoins. We conducted extensive performance studies, and confirm the efficiency of our proposed new approaches.
Keyword:
Graph matching
2-hop labeling
reachability joins
join/semijoin processing
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.9K
被引数:
3.2W
机构
引用论文
Holocene erosion of the Lesser Himalaya triggered by intensified summer monsoon夏季风加剧引发的小喜马拉雅山全新世侵蚀
Geology
IF0
Electric field effects on the droplet structure in polymer dispersed cholesteric liquid crystals电场对聚合物分散胆甾相液晶中液滴结构的影响

