STEFFI – Scalable Traversal Engine For Fast In-memory graphDB
From the webpage:
STEFFI is a distributed graph database fully in-memory and amazingly fast when it comes to querying large datasets.
As a scalable graph database, STEFFI’s performance can directly be compared to Neo4j and Titan. It provides its users with a clear competitive advantage when it comes to complicated traversal operations on large datasets. Speedups of up to 200 have been observed when comparing STEFFI whith its alternatives.
More than an alternative to existing solutions, STEFFI opens up new possibilities for high-performance graph storage and manipulation.
Main features
- in-memory storage for a fast random access
- distributed parallel computing for high-speed graph queries
- graph traversal engine for graph processing
- scalability for a growing data
- implementing the Blueprints API from tinkerpop for an enchanced accessibility
Recommended for
- fast recommendation engines (e-commerce, telecommunications, finance, …)
- large biological networks analysis (biopharma, healthcare, … )
- security networks management & real-time fraud detection (bank, public institutions, …)
- complex network & data center management (telecommunications, e-commerce, …)
- and much more!
Availability
STEFFI is currently in its incubation phase within EURA NOVA. Once the code is mature and stable enough, STEFFI will be provided via this website under the Apache Licence Version 2. If you would like to know more about this project evolution, do not hesitate to subscribe to our mailing list or contact EURA NOVA.
I haven’t run the performance tests personally against Neo4j and Titan but the reported performance gains (200X and 150X, respectively) are impressive.
BTW, you probably want the paper that lead to STEFFI, imGraph: A distributed in-memory graph database by Salim Jouili and Aldemar Reynaga.