Welcome to the InfoSci Platform
Reference Hub1
A Survey of Relational Approaches for Graph Pattern Matching over Large Graphs

A Survey of Relational Approaches for Graph Pattern Matching over Large Graphs

Jiefeng Cheng, Jeffrey Xu Yu
Copyright: © 2012 |Pages: 30
ISBN13: 9781613500538|ISBN10: 161350053X|EISBN13: 9781613500545
DOI: 10.4018/978-1-61350-053-8.ch006
Cite Chapter Cite Chapter

MLA

Cheng, Jiefeng, and Jeffrey Xu Yu. "A Survey of Relational Approaches for Graph Pattern Matching over Large Graphs." Graph Data Management: Techniques and Applications, edited by Sherif Sakr and Eric Pardede, IGI Global, 2012, pp. 112-141. https://doi.org/10.4018/978-1-61350-053-8.ch006

APA

Cheng, J. & Yu, J. X. (2012). A Survey of Relational Approaches for Graph Pattern Matching over Large Graphs. In S. Sakr & E. Pardede (Eds.), Graph Data Management: Techniques and Applications (pp. 112-141). IGI Global. https://doi.org/10.4018/978-1-61350-053-8.ch006

Chicago

Cheng, Jiefeng, and Jeffrey Xu Yu. "A Survey of Relational Approaches for Graph Pattern Matching over Large Graphs." In Graph Data Management: Techniques and Applications, edited by Sherif Sakr and Eric Pardede, 112-141. Hershey, PA: IGI Global, 2012. https://doi.org/10.4018/978-1-61350-053-8.ch006

Export Reference

Mendeley
Favorite

Abstract

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 and analyze large graph datasets effectively and efficiently. Among those techniques, a graph pattern matching problem receives increasing attention, which is to find all patterns in a large data graph that match a user-given graph pattern. In this survey, we review approaches to process such graph pattern queries with a framework of multi joins, which can be easily implemented in relational databases and requires no specialized native storage for graphs. We also discuss the top-k graph pattern matching problem.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.