Analysis of multilevel graph partitioning
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
A Graph-Based Method for Face Identification from a Single 2D Line Drawing
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Algorithmics and applications of tree and graph searching
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Graph indexing: a frequent structure-based approach
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Proceedings of the VLDB Endowment
GADDI: distance index based subgraph matching in biological networks
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Flexible query answering on graph-modeled data
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
QNet: a tool for querying protein interaction networks
RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology
On graph query optimization in large networks
Proceedings of the VLDB Endowment
SAPPER: subgraph indexing and approximate matching in large graphs
Proceedings of the VLDB Endowment
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
SQBC: An efficient subgraph matching method over large and dense graphs
Information Sciences: an International Journal
Hi-index | 0.00 |
Recently, subgraph queries over large graph-structured data have attracted lots of attentions. Most of the recent algorithms proposed to solve this problem apply the structural features of graphs to construct the index, such as path, tree and subgraph. However, there is no a solid theory foundation of which structure is the best one to construct the index. What is more, the cost of mining these structures is rather expensive. In this paper, we present a high performance graph query algorithm, SMS, based on the simple yet effective neighborhood structure. To further improve the query performance, a graph partition solution is proposed and the efficient codes of vertices and blocks are carefully designed. Extensive experimental studies demonstrate the effectiveness and scalability of our algorithm in the issue of subgraph queries on large graph-structured data.