The Community for Technology Leaders
2008 IEEE 24th International Conference on Data Engineering (2008)
Cancun, Mexico
Apr. 7, 2008 to Apr. 12, 2008
ISBN: 978-1-4244-1836-7
pp: 913-922
Jiefeng Cheng , The Chinese University of Hong Kong, China. jfcheng@se.cuhk.edu.hk
Jeffrey Xu Yu , The Chinese University of Hong Kong, China. yu@se.cuhk.edu.hk
Bolin Ding , The Chinese University of Hong Kong, China. blding@se.cuhk.edu.hk
Philip S. Yu , University of Illinois at Chicago, USA. psyu@cs.uic.edu
Haixun Wang , T. J. Watson Research Center, IBM, USA. haixun@us.ibm.com
ABSTRACT
Due to rapid growth of the Internet technology and new scientific/technological advances, the number of applications that model data as graphs increases, because graphs have high expressive power to model complicated structures. The dominance of graphs in real-world applications asks for new graph data management so that users can access graph data effectively and efficiently. In this paper, we study a graph pattern matching problem over a large data graph. The problem is to find all patterns in a large data graph that match a user-given graph pattern. We propose a new two-step R-join (reachability join) algorithm with filter step and fetch step based on a cluster-based join-index with graph codes. We consider the filter step as an R-semijoin, and propose a new optimization approach by interleaving R-joins with R-semijoins. We conducted extensive performance studies, and confirm the efficiency of our proposed new approaches.
INDEX TERMS
CITATION

H. Wang, B. Ding, J. X. Yu, P. S. Yu and J. Cheng, "Fast Graph Pattern Matching," 2008 IEEE 24th International Conference on Data Engineering(ICDE), Cancun, Mexico, 2008, pp. 913-922.
doi:10.1109/ICDE.2008.4497500
83 ms
(Ver 3.3 (11022016))