Periscope/GQ: a graph querying toolkit
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
G-hash: towards fast kernel-based similarity search in large graph databases
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Large-scale malware indexing using function-call graphs
Proceedings of the 16th ACM conference on Computer and communications security
Distance-join: pattern match query in a large graph database
Proceedings of the VLDB Endowment
Biochemical network matching and composition
Proceedings of the 2010 EDBT/ICDT Workshops
Querying graphs with uncertain predicates
Proceedings of the Eighth Workshop on Mining and Learning with Graphs
An efficient features-based processing technique for supergraph queries
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
DSI: a method for indexing large graphs using distance set
WAIM'10 Proceedings of the 11th international conference on Web-age information management
iGraph: a framework for comparisons of disk-based graph indexing techniques
Proceedings of the VLDB Endowment
Graph homomorphism revisited for graph matching
Proceedings of the VLDB Endowment
SAPPER: subgraph indexing and approximate matching in large graphs
Proceedings of the VLDB Endowment
A tool for fast indexing and querying of graphs
Proceedings of the 20th international conference companion on World wide web
Structure and attribute index for approximate graph matching in large graphs
Information Systems
Content-based search of model repositories with graph matching techniques
Proceedings of the 3rd International Workshop on Search-Driven Development: Users, Infrastructure, Tools, and Evaluation
Neighborhood based fast graph search in large networks
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
On the privacy of anonymized networks
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Graph-based search over web application model repositories
ICWE'11 Proceedings of the 11th international conference on Web engineering
Subgraph search over massive disk resident graphs
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
BR-index: an indexing structure for subgraph matching in very large dynamic graphs
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
A path-oriented RDF index for keyword search query processing
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
DELTA: indexing and querying multi-labeled graphs
Proceedings of the 20th ACM international conference on Information and knowledge management
Capturing topology in graph pattern matching
Proceedings of the VLDB Endowment
Knowledge hiding from tree and graph databases
Data & Knowledge Engineering
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
Distributed graph pattern matching
Proceedings of the 21st international conference on World Wide Web
TreeSpan: efficiently computing similarity all-matching
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Efficient subgraph similarity all-matching
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Review of bisonet abstraction techniques
Bisociative Knowledge Discovery
Comparing and fusing terrain network information
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
Certain and possible XPath answers
Proceedings of the 16th International Conference on Database Theory
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
A similarity measure for approximate querying over RDF data
Proceedings of the Joint EDBT/ICDT 2013 Workshops
Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Approximate graph mining with label costs
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Graph similarity search with edit distance constraint in large graph databases
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Strong simulation: Capturing topology in graph pattern matching
ACM Transactions on Database Systems (TODS)
Fast exact graph matching using adjacency matrices
Proceedings of the The third workshop on Procedural Content Generation in Games
SQBC: An efficient subgraph matching method over large and dense graphs
Information Sciences: an International Journal
Efficient processing of graph similarity queries with edit distance constraints
The VLDB Journal — The International Journal on Very Large Data Bases
WOOster: a map-reduce based platform for graph mining
Proceedings of the 17th International Conference on Management of Data
Hi-index | 0.00 |
Large graph datasets are common in many emerging database applications, and most notably in large-scale scientific applications. To fully exploit the wealth of information encoded in graphs, effective and efficient graph matching tools are critical. Due to the noisy and incomplete nature of real graph datasets, approximate, rather than exact, graph matching is required. Furthermore, many modern applications need to query large graphs, each of which has hundreds to thousands of nodes and edges. This paper presents a novel technique for approximate matching of large graph queries. We propose a novel indexing method that incorporates graph structural information in a hybrid index structure. This indexing technique achieves high pruning power and the index size scales linearly with the database size. In addition, we propose an innovative matching paradigm to query large graphs. This technique distinguishes nodes by their importance in the graph structure. The matching algorithm first matches the important nodes of a query and then progressively extends these matches. Through experiments on several real datasets, this paper demonstrates the effectiveness and efficiency of the proposed method.