iGraph: A Framework for Comparisons of Disk-Based Graph Indexing Techniques

Graphs are of growing importance in modeling complex structures such as chemical compounds, proteins, images, and program dependence. Given a query graph Q, the subgraph isomorphism problem is to find a set of graphs containing Q from a graph database, which is NP-complete. Recently, there have been a lot of research efforts to solve the subgraph isomorphism problem for a large graph database by utilizing graph indexes. By using a graph index as a filter, we prune graphs that are not real answers at an inexpensive cost. Then, we need to use expensive subgraph isomorphism tests to verify filtered candidates only. This way, the number of disk I/Os and subgraph isomorphism tests can be significantly minimized. The current practice for experiments in graph indexing techniques is that the author of a newly proposed technique does not implement existing indexes on his own code base, but instead uses the original authors’ binary executables and reports only the wall clock time. However...

• Type: Journal
• Year: 2010
• Where: PVLDB
• Authors: Wook-Shin Han, Jinsoo Lee, Minh-Duc Pham, Jeffrey Xu Yu
• Keywords: Graph Database, PVLDB 2010, Subgraph Isomorphism, Subgraph Isomorphism Problem