Best Graph Databases for Linux

With ready access to the richest flexible semantic layer, explainable AI, and reusable data modeling, data engineers and scientists can be 95% more productive — create and expand semantic data models, understand any data interrelationship, and run federated queries to speed time to insight. Stardog offers the most advanced graph data virtualization and high-performance graph database — up to 57x better price/performance — to connect any data lakehouse, warehouse or enterprise data source without moving or copying data. Scale use cases and users at lower infrastructure cost. Stardog’s inference engine intelligently applies expert knowledge dynamically at query time to uncover hidden patterns or unexpected insights in relationships that enable better data-informed decisions and business outcomes.

Graphlytic is a customizable web platform for knowledge graph visualization and analysis. Users can interactively explore the graph, look for patterns with the Cypher or Gremlin query languages (or query templates for non-tech users), or use filters to find the answers to any graph question. The graph visualization brings deep insights in industries, such as scientific research, anti-fraud investigation, etc. Users with very little graph theory knowledge can start to explore the data in no time. Graph rendering is done with the Cytoscape.js library which allows us to render tens of thousands of nodes and hundreds of thousands of relationships. The application is provided in three ways: Desktop, Cloud, and Server. Graphlytic Desktop is a free Neo4j Desktop application installed in just a few clicks. Cloud instances are ideal for small teams that don't want to worry about the installation and need to get up and running in very little time.

VelocityDB is a database engine like no other. It can store data faster and more efficiently than any other solution at a fraction of the cost of other database engines. It stores .NET objects as they are with no mapping to tables, JSON or XML. VelocityGraph is an add on open source property graph database that can be used in conjunction with the VelocityDB object database. Object and graph database engine VelocityDB is a C# .NET noSQL object fatabase, extended as graph database is VelocityGraph. World’s fastest most scalable & flexible database. A bug reported with a reproducible test case is usually fixed within a week. The most important benefit is the flexibility that this database system provides. No other types of database system lets you fine tune your application to the finest details. Using VelocityDB, you can choose the best possible data structures for your application. You can control where you place the data persistently and how it's indexed and accessed.

InfiniteGraph is a massively scalable graph database specifically designed to excel at high-speed ingest of massive volumes of data (billions of nodes and edges per hour) while supporting complex queries. InfiniteGraph can seamlessly distribute connected graph data across a global enterprise. InfiniteGraph is a schema-based graph database that supports highly complex data models. It also has an advanced schema evolution capability that allows you to modify and evolve the schema of an existing database. InfiniteGraph’s Placement Management Capability allows you to optimize the placement of data items resulting in tremendous performance improvements in both query and ingest. InfiniteGraph has client-side caching which caches frequently used node and edges. InfiniteGraph's DO query language enables complex "beyond graph" queries not supported by other query languages.

OrigoDB enables you to build high quality, mission critical systems with real-time performance at a fraction of the time and cost. This is not marketing gibberish! Please read on for a no nonsense description of our features. Get in touch if you have questions or download and try it out today! In-memory operations are orders of magnitude faster than disk operations. A single OrigoDB engine can execute millions of read transactions per second and thousands of write transactions per second with synchronous command journaling to a local SSD. This is the #1 reason we built OrigoDB. A single object oriented domain model is far simpler than the full stack including a relational model, object/relational mapping, data access code, views and stored procedures. That's a lot of waste that can be eliminated! The OrigoDB engine is 100% ACID out of the box. Commands execute one at a time, transitioning the in-memory model from one consistent state to the next.

Apache TinkerPop™ is a graph computing framework for both graph databases (OLTP) and graph analytic systems (OLAP). Gremlin is the graph traversal language of Apache TinkerPop. Gremlin is a functional, data-flow language that enables users to succinctly express complex traversals on (or queries of) their application's property graph. Every Gremlin traversal is composed of a sequence of (potentially nested) steps. A graph is a structure composed of vertices and edges. Both vertices and edges can have an arbitrary number of key/value pairs called properties. Vertices denote discrete objects such as a person, a place, or an event. Edges denote relationships between vertices. For instance, a person may know another person, have been involved in an event, and/or have recently been at a particular place. If a user's domain is composed of a heterogeneous set of objects (vertices) that can be related to one another in a multitude of ways (edges).

Manage complex models using ArcadeDB without any compromise. Forget about Polyglot Persistence. no need for multiple databases. You can store graphs, documents, key values and time series all in one ArcadeDB Multi-Model database. Since each model is native to the database engine, you don't have to worry about translations slowing you down. ArcadeDB's engine was built with Alien Technology. It's able to crunch millions of records per second. With ArcadeDB, the traversing speed is not affected by the database size. It is always constant, whether your database has a few records or billions. ArcadeDB can work as an embedded database, on a single server and can scale up using multiple servers with Kubernetes. Flexible enough to run on any platform with a small footprint. Your data is secure. Our unbreakable fully transactional engine assures durability for mission-critical production databases. ArcadeDB uses a Raft Consensus Algorithm to maintain consistency across multiple servers.

Memgraph offers a light and powerful graph platform comprising the Memgraph Graph Database, MAGE Library, and Memgraph Lab Visualization. Memgraph is a dynamic, lightweight graph database optimized for analyzing data, relationships, and dependencies quickly and efficiently. It comes with a rich suite of pre-built deep path traversal algorithms and a library of traditional, dynamic, and ML algorithms tailored for advanced graph analysis, making Memgraph an excellent choice in critical decision-making scenarios such as risk assessment (fraud detection, cybersecurity threat analysis, and criminal risk assessment), 360-degree data and network exploration (Identity and Access Management (IAM), Master Data Management (MDM), Bill of Materials (BOM)), and logistics and network optimization.

Build high quality, mission critical applications with real-time performance at a fraction of the time and cost. Memstate is a new. Moving data back and forth between disk and RAM is not just extremely inefficient, it requires multiple layers of complex software that can be eliminated entirely. Use Memstate to structure and manage your data in-memory, obtain transparent persistence, concurrency control and transactions with strong ACID guarantees. note: this is too techy... Make your applications 100x faster, and your developers 10x more productive. Memstate has many possible use cases but is designed primarily to handle complex OLTP workloads in a typical enterprise application. In-memory operations are orders of magnitude faster than disk operations. A single Memstate engine can execute millions of read transactions and tens of thousands of write transactions per second, all at submillisecond latency.

HyperGraphDB is a general purpose, open-source data storage mechanism based on a powerful knowledge management formalism known as directed hypergraphs. While a persistent memory model designed mostly for knowledge management, AI and semantic web projects, it can also be used as an embedded object-oriented database for Java projects of all sizes. Or a graph database, or a (non-SQL) relational database. HyperGraphDB is a storage framework based on generalized hypergraphs as its underlying data model. The unit of storage is a tuple made up of 0 or more other tuples. Each such tuple is called an atom. One could think of the data model as relational where higher-order, n-ary relationships are allowed or as graph-oriented where edges can point to an arbitrary set of nodes and other edges. Each atom has an arbitrary, strongly-typed value associated with it. The type system managing those values is embedded as a hypergraph and customizable from the ground up.

RecallGraph is a versioned-graph data store - it retains all changes that its data (vertices and edges) have gone through to reach their current state. It supports point-in-time graph traversals, letting the user query any past state of the graph just as easily as the present. RecallGraph is a potential fit for scenarios where data is best represented as a network of vertices and edges (i.e., a graph) having the following characteristics: 1. Both vertices and edges can hold properties in the form of attribute/value pairs (equivalent to JSON objects). 2. Documents (vertices/edges) mutate within their lifespan (both in their individual attributes/values and in their relations with each other). 3. Past states of documents are as important as their present, necessitating retention and queryability of their change history. Also see this blog post for an intro - https://blog.recallgraph.tech/never-lose-your-old-data-again.

Cayley is an open-source database for Linked Data. It is inspired by the graph database behind Google's Knowledge Graph (formerly Freebase). Cayley is an open-source graph database designed for ease of use and storing complex data. Built-in query editor, visualizer and REPL. Cayley can use multiple query languages like Gizmo, a query language inspired by Gremlin, GraphQL-inspired query language, MQL a simplified version for Freebase fans. Cayley is modular, easy to connect to your favorite programming languages and back-end stores, production ready, well tested and used by various companies for their production workloads and fast with optimized specifically for usage in applications. Rough performance testing shows that, on 2014 consumer hardware and an average disk, 134m quads in LevelDB is no problem and a multi-hop intersection query- films starring X and Y - takes ~150ms. Cayley is configured by default to run in memory (That's what backend memstore means).