Edinburgh Research Explorer

Capturing Topology in Graph Pattern Matching

Research output: Contribution to journalArticle

Related Edinburgh Organisations

Documents

http://vldb.org/pvldb/vol5/p310_shuaima_vldb2012.pdf
Original languageEnglish
Pages (from-to)310-321
Number of pages12
JournalProceedings of the VLDB Endowment (PVLDB)
Volume5
Issue number4
Publication statusPublished - 2011

Abstract

Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been considered instead. These extensions allow pattern matching to be conducted in cubic-time. However, they fall short of capturing the topology of data graphs, i.e., graphs may have a structure drastically different from pattern graphs they match, and the matches found are often too large to understand and analyze. To rectify these problems, this paper proposes a notion of strong simulation, a revision of graph simulation, for graph pattern matching. (1) We identify a set of criteria for preserving the topology of graphs matched. We show that strong simulation preserves the topology of data graphs and finds a bounded number of matches. (2) We show that strong simulation retains the same complexity as earlier extensions of simulation, by providing a cubic-time algorithm for computing strong simulation. (3) We present the locality property of strong simulation, which allows us to effectively conduct pattern matching on distributed graphs. (4) We experimentally verify the effectiveness and efficiency of these algorithms, using real-life data and synthetic data.

Download statistics

No data available

ID: 17628044