Computing subgraph isomorphic queries using structural unification and minimum graph structures

Authors:
Hasan Jamil
Affiliations:
Wayne State University
Venue:
Proceedings of the 2011 ACM Symposium on Applied Computing
Year:
2011

Citing 11
Cited 4

The anatomy of a large-scale hypertextual Web search engine

WWW7 Proceedings of the seventh international conference on World Wide Web 7
An Algorithm for Subgraph Isomorphism

Journal of the ACM (JACM)
Artificial Intelligence

Artificial Intelligence
Algorithms on Trees and Graphs

Algorithms on Trees and Graphs
Graph indexing: a frequent structure-based approach

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Exact and Approximate Graph Matching Using Random Walks

IEEE Transactions on Pattern Analysis and Machine Intelligence
SAGA: a subgraph matching tool for biological graphs

Bioinformatics
Fg-index: towards verification-free query processing on graph databases

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Exploring biological network structure using exponential random graph models

Bioinformatics
Graphs-at-a-time: query language and access methods for graph databases

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism

Proceedings of the VLDB Endowment

Integrating large and distributed life sciences resources for systems biology research: progress and new challenges

Transactions on large-scale data- and knowledge-centered systems III
Faster subgraph isomorphism detection by well-founded total order indexing

Pattern Recognition Letters
Kernels for acyclic digraphs

Pattern Recognition Letters
CodeBlast: a two-stage algorithm for improved program similarity matching in large software repositories

Proceedings of the 28th Annual ACM Symposium on Applied Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

Graphs and trees play a major role in many applications including social networks, internet management, science, and business. Yet, there remains a serious lack of tools for graph data management, analysis and querying. Systems that rely on non-traditional complex relationships among objects naturally invite a fresh look at data models and query languages suitable for applications that require graphs as first class citizens. In this paper, we propose a new data model for the storage and management of graph objects, and present a heuristic algorithm to efficiently compute subgraph isomorphic queries, and show that the same algorithm can be adapted to perform a wide range of graph queries. We rely upon the introduction of the idea of structural unification, a novel graph representation based on minimum structures, and an indexing mechanism for storing minimum graph structures. We experimentally show that our approach yields significant speed up over the two leading subgraph isomorphism algorithms Ullmann and VFLib.