The aim of this project is to implement various subgraph isomorphism algorithms and related techniques implemented in the GraphQL[1] paper along with the optimizations mentioned in the following sections from the paper on the Neo4j graph database.
- Section 4.2 Local Pruning and retrieval of Feasible Mates
- Section 4.3 Joint Reduction of search space
- Download the Protein dataset and follow instructions on how to use the target and query graphs.
- Install Neo4j Graph database and use the java driver to connect to the database - https://neo4j.com/developer/java/
- Execute the java file to create the database graph from the dataset
- Specify the query graph to get started with searching
Open an issue here.
[1] Huahai He and Ambuj K. Singh. Graphs-at-a-time: Query language and access methods for graph databases. In Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, SIGMOD ’08, pages 405–418, New York, NY, USA, 2008. ACM.