An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
The state of the art in distributed query processing
ACM Computing Surveys (CSUR)
Communication and Concurrency
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Introduction to Algorithms
ACM Transactions on Computational Logic (TOCL)
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
On the Approximability of the Maximum Common Subgraph Problem
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Computing simulations on finite and infinite graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
The Subgraph Bisimulation Problem
IEEE Transactions on Knowledge and Data Engineering
A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
Social matching: A framework and research agenda
ACM Transactions on Computer-Human Interaction (TOCHI)
GPLAG: detection of software plagiarism by program dependence graph analysis
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Distributed query evaluation with performance guarantees
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
MapReduce: simplified data processing on large clusters
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Fast best-effort pattern matching in large attributed graphs
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Minimization of tree pattern queries with constraints
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Distributed XML processing: Theory and applications
Journal of Parallel and Distributed Computing
TALE: A Tool for Approximate Large Graph Matching
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Distance-join: pattern match query in a large graph database
Proceedings of the VLDB Endowment
Managing and Mining Graph Data
Managing and Mining Graph Data
From polynomial time queries to graph structure theory
Proceedings of the 13th International Conference on Database Theory
Pregel: a system for large-scale graph processing
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Detecting Social Positions Using Simulation
ASONAM '10 Proceedings of the 2010 International Conference on Advances in Social Networks Analysis and Mining
Graph pattern matching: from intractable to polynomial time
Proceedings of the VLDB Endowment
Adding regular expressions to graph reachability and pattern queries
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Distributed graph pattern matching
Proceedings of the 21st international conference on World Wide Web
Graph pattern matching revised for social network analysis
Proceedings of the 15th International Conference on Database Theory
NeMa: fast graph search with label similarity
Proceedings of the VLDB Endowment
Incremental graph pattern matching
ACM Transactions on Database Systems (TODS)
BNCOD'13 Proceedings of the 29th British National conference on Big Data
Database research challenges and opportunities of big graph data
BNCOD'13 Proceedings of the 29th British National conference on Big Data
Strong simulation: Capturing topology in graph pattern matching
ACM Transactions on Database Systems (TODS)
Hi-index | 0.00 |
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.