Graph similarity search with edit distance constraint in large graph databases

Authors:
Weiguo Zheng;Lei Zou;Xiang Lian;Dong Wang;Dongyan Zhao
Affiliations:
Peking University, Beijing, China;Peking University, Beijing, China;University of Texas - Pan American, Edinburg, USA;Peking University, Beijing, China;Peking University, Beijing, China
Venue:
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Year:
2013

Citing 14
Cited 0

On a relation between graph edit distance and maximum common subgraph

Pattern Recognition Letters
A graph distance metric based on the maximal common subgraph

Pattern Recognition Letters
Graph Edit Distance from Spectral Seriation

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
A Binary Linear Programming Formulation of the Graph Edit Distance

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

Bioinformatics
Fast best-effort pattern matching in large attributed graphs

Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
TALE: A Tool for Approximate Large Graph Matching

ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Comparing stars: on approximating graph edit distance

Proceedings of the VLDB Endowment
On graph query optimization in large networks

Proceedings of the VLDB Endowment
Neighborhood based fast graph search in large networks

Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
gStore: answering SPARQL queries via subgraph matching

Proceedings of the VLDB Endowment
Efficiently Indexing Large Sparse Graphs for Similarity Search

IEEE Transactions on Knowledge and Data Engineering
Efficient Graph Similarity Joins with Edit Distance Constraints

ICDE '12 Proceedings of the 2012 IEEE 28th International Conference on Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Due to many real applications of graph databases, it has become increasingly important to retrieve graphs g (in graph database D) that approximately match with query graph q, rather than exact subgraph matches. In this paper, we study the problem of graph similarity search, which retrieves graphs that are similar to a given query graph under the constraint of the minimum edit distance. Specifically, we derive a lower bound, branch-based bound, which can greatly reduce the search space of the graph similarity search. We also propose a tree index structure, namely b-tree, to facilitate effective pruning and efficient query processing. Extensive experiments confirm that our proposed approach outperforms the existing approaches by orders of magnitude, in terms of both pruning power and query response time.