In:
Proceedings of the VLDB Endowment, Association for Computing Machinery (ACM), Vol. 6, No. 2 ( 2012-12), p. 133-144
Abstract:
Finding subgraph isomorphisms is an important problem in many applications which deal with data modeled as graphs. While this problem is NP-hard, in recent years, many algorithms have been proposed to solve it in a reasonable time for real datasets using different join orders, pruning rules, and auxiliary neighborhood information. However, since they have not been empirically compared one another in most research work, it is not clear whether the later work outperforms the earlier work. Another problem is that reported comparisons were often done using the original authors' binaries which were written in different programming environments. In this paper, we address these serious problems by re-implementing five state-of-the-art subgraph isomorphism algorithms in a common code base and by comparing them using many real-world datasets and their query loads. Through our in-depth analysis of experimental results, we report surprising empirical findings.
Type of Medium:
Online Resource
ISSN:
2150-8097
DOI:
10.14778/2535568.2448946
Language:
English
Publisher:
Association for Computing Machinery (ACM)
Publication Date:
2012
detail.hit.zdb_id:
2478691-3
