TALE: A Tool for Approximate Large Graph Matching

Abstract

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.

DOI: 10.1109/ICDE.2008.4497505

10 Figures and Tables

0502008200920102011201220132014201520162017
Citations per Year

444 Citations

Semantic Scholar estimates that this publication has 444 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Tian2008TALEAT, title={TALE: A Tool for Approximate Large Graph Matching}, author={Yuanyuan Tian and Jignesh M. Patel}, journal={2008 IEEE 24th International Conference on Data Engineering}, year={2008}, pages={963-972} }