An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
Efficient Matching and Indexing of Graph Models in Content-Based Retrieval
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Data Structures and Algorithms
Data Structures and Algorithms
Introduction to Algorithms
gSpan: Graph-Based Substructure Pattern Mining
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Graph indexing: a frequent structure-based approach
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Substructure similarity search in graph databases
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Canonical forms for labelled trees and their applications in frequent subtree mining
Knowledge and Information Systems
Closure-Tree: An Index Structure for Graph Queries
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Fg-index: towards verification-free query processing on graph databases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Fast Frequent Free Tree Mining in Graph Databases
World Wide Web
A novel spectral coding in a large graph database
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
A novel approach for efficient supergraph query processing on graph databases
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Proceedings of the 2010 ACM Symposium on Applied Computing
GBLENDER: towards blending visual query formulation and query processing in graph databases
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Connected substructure similarity search
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
PrefIndex: an efficient supergraph containment search technique
SSDBM'10 Proceedings of the 22nd international conference on Scientific and statistical database management
On graph query optimization in large networks
Proceedings of the VLDB Endowment
iGraph: a framework for comparisons of disk-based graph indexing techniques
Proceedings of the VLDB Endowment
SAPPER: subgraph indexing and approximate matching in large graphs
Proceedings of the VLDB Endowment
Efficient algorithms for supergraph query processing on graph databases
Journal of Combinatorial Optimization
A tool for fast indexing and querying of graphs
Proceedings of the 20th international conference companion on World wide web
Computing subgraph isomorphic queries using structural unification and minimum graph structures
Proceedings of the 2011 ACM Symposium on Applied Computing
Structure and attribute index for approximate graph matching in large graphs
Information Systems
Neighborhood based fast graph search in large networks
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
iGraph in action: performance analysis of disk-based graph indexing techniques
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Aggregated search in graph databases: preliminary results
GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
Fast graph query processing with a low-cost index
The VLDB Journal — The International Journal on Very Large Data Bases
Answering subgraph queries over large graphs
WAIM'11 Proceedings of the 12th international conference on Web-age information management
Graph aggregation based image modeling and indexing for video annotation
CAIP'11 Proceedings of the 14th international conference on Computer analysis of images and patterns - Volume Part II
CP-index: on the efficient indexing of large graphs
Proceedings of the 20th ACM international conference on Information and knowledge management
NOVA: a novel and efficient framework for finding subgraph isomorphism mappings in large graphs
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
Querying large graph databases
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
TreeSpan: efficiently computing similarity all-matching
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Finding top-k similar graphs in graph databases
Proceedings of the 15th International Conference on Extending Database Technology
Indexing and mining topological patterns for drug discovery
Proceedings of the 15th International Conference on Extending Database Technology
A relational-based approach for aggregated search in graph databases
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Efficient subgraph similarity all-matching
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Finding patterns in an unknown graph
AI Communications - The Symposium on Combinatorial Search
RDF pattern matching using sortable views
Proceedings of the 21st ACM international conference on Information and knowledge management
Efficient algorithms for generalized subgraph query processing
Proceedings of the 21st ACM international conference on Information and knowledge management
An in-depth comparison of subgraph isomorphism algorithms in graph databases
Proceedings of the VLDB Endowment
NeMa: fast graph search with label similarity
Proceedings of the VLDB Endowment
Compressed feature-based filtering and verification approach for subgraph search
Proceedings of the 16th International Conference on Extending Database Technology
Efficient breadth-first search on large graphs with skewed degree distributions
Proceedings of the 16th International Conference on Extending Database Technology
Lindex: a lattice-based index for graph databases
The VLDB Journal — The International Journal on Very Large Data Bases
Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Mining and indexing graphs for supergraph search
Proceedings of the VLDB Endowment
SQBC: An efficient subgraph matching method over large and dense graphs
Information Sciences: an International Journal
Querying business process model repositories
World Wide Web
Journal of Biomedical Informatics
Hi-index | 0.00 |
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query graph, from a large set of graphs. Considering the problem of testing subgraph isomorphism is generally NP-hard, most of the existing techniques are based on the framework of filtering-and-verification to reduce the precise computation costs; consequently various novel feature-based indexes have been developed. While the existing techniques work well for small query graphs, the verification phase becomes a bottleneck when the query graph size increases. Motivated by this, in the paper we firstly propose a novel and efficient algorithm for testing subgraph isomorphism, QuickSI. Secondly, we develop a new feature-based index technique to accommodate QuickSI in the filtering phase. Our extensive experiments on real and synthetic data demonstrate the efficiency and scalability of the proposed techniques, which significantly improve the existing techniques.