An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases

Download Now
Provided by: VLD Digital
Topic: Data Management
Format: PDF
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 paper; it is not clear whether the later paper outperforms the earlier paper. Another problem is that reported comparisons were often done using the original authors' binaries which were written in different programming environments.
Download Now

Find By Topic