Title:
Mage: Expressive Pattern Matching in Richly-Attributed Graphs
Mage: Expressive Pattern Matching in Richly-Attributed Graphs
| dc.contributor.author | Pienta, Robert | |
| dc.contributor.author | Tamersoy, Acar | |
| dc.contributor.author | Tong, Hanghang | |
| dc.contributor.author | Chau, Duen Horng | |
| dc.contributor.corporatename | Georgia Institute of Technology. College of Computing | en_US |
| dc.contributor.corporatename | Georgia Institute of Technology. School of Computational Science and Engineering | en_US |
| dc.contributor.corporatename | City University of New York. Department of Computer Science | en_US |
| dc.date.accessioned | 2013-11-04T15:29:04Z | |
| dc.date.available | 2013-11-04T15:29:04Z | |
| dc.date.issued | 2013 | |
| dc.description | Research area: Graph analysis | en_US |
| dc.description.abstract | Given a large graph with millions of nodes and edges, say a social graph where both the nodes and edges can have multiple different kinds of attributes (e.g., job titles, tie strengths), how do we quickly find matches for subgraphs of interest (e.g., a ring of businessmen with strong ties)? We propose MAGE, Multiple Attribute Graph Engine, a subgraph matching framework that pushes the envelope of graph matching capabilities and performance, through several major innovations: (i) with line graph transformation, MAGE works for graphs with both node and edge attributes and return both exact as well as near matches — other techniques often support only node attributes and return only exact matches; (ii) MAGE supports a plethora of queries, including multiple attributes for each node or edge, wild-cards as attribute values (i.e., match any permissible value), and continuous attributes via multiple discretization strategies; (iii) MAGE leverages a novel technique based on memory mapping to compute random walk with restart probabilities, which provides a speedup of more than 2 orders of magnitude on large graphs. We evaluated MAGE’s effectiveness and scalability with real and synthetic graphs with up to 2.3 million edges. Experimental results on the DBLP authorship graph and the Rotten Tomatoes movie graph illustrate the effectiveness and exploratory functionality of our contributions to graph querying. By devising query-centric innovations, our work improves the ease with which a user can explore their graph data. | en_US |
| dc.embargo.terms | null | en_US |
| dc.identifier.uri | http://hdl.handle.net/1853/49341 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Georgia Institute of Technology | en_US |
| dc.relation.ispartofseries | CSE Technical Reports ; GT-CSE-13-08 | en_US |
| dc.subject | Graph mining | en_US |
| dc.subject | Graph querying | en_US |
| dc.subject | Graph search | en_US |
| dc.title | Mage: Expressive Pattern Matching in Richly-Attributed Graphs | en_US |
| dc.type | Text | |
| dc.type.genre | Technical Report | |
| dspace.entity.type | Publication | |
| local.contributor.author | Chau, Duen Horng | |
| local.contributor.corporatename | College of Computing | |
| local.contributor.corporatename | School of Computational Science and Engineering | |
| local.relation.ispartofseries | College of Computing Technical Report Series | |
| local.relation.ispartofseries | School of Computational Science and Engineering Technical Report Series | |
| relation.isAuthorOfPublication | fb5e00ae-9fb7-475d-8eac-50c48a46ea23 | |
| relation.isOrgUnitOfPublication | c8892b3c-8db6-4b7b-a33a-1b67f7db2021 | |
| relation.isOrgUnitOfPublication | 01ab2ef1-c6da-49c9-be98-fbd1d840d2b1 | |
| relation.isSeriesOfPublication | 35c9e8fc-dd67-4201-b1d5-016381ef65b8 | |
| relation.isSeriesOfPublication | 5a01f926-96af-453d-a75b-abc3e0f0abb3 |