https://github.com/RedisGraph/RedisGraph/
Their paper claims that computing with adjacency (sparse) matrices is more performant than alternatives:
https://arxiv.org/pdf/1905.01294.pdf
They compile queries written in Cypher (Neo4j's language) to operations in linear algebra. An example query is:
MATCH (n:actor{name:"Nicolas Cage"})-[:act]->(m:movie)<-[:act]-(a:actor) RETURN a.name, m.title
https://oss.redislabs.com/redisgraph/cypher_support/
https://github.com/RedisGraph/RedisGraph/
Their paper claims that computing with adjacency (sparse) matrices is more performant than alternatives:
https://arxiv.org/pdf/1905.01294.pdf
They compile queries written in Cypher (Neo4j's language) to operations in linear algebra. An example query is: