zhouaimin / multi-query-subgraph-matching Goto Github PK

This project forked from ritvikjoshi/multi-query-subgraph-matching

Implemented Multi-query sub graph isomorphism search algorithm to optimize general subgraph matching performed on graph databases such as Neo4j or Cassandra. The algorithm creates new queries by identifying common graphs in multiple queries and extract and store the result in the cache to avoid the redundant search for the same common graph. The optimized algorithm reduced the search time by 20% on average on iHuman and iProtein graph dataset stored in Neo4j graph database.