DBMS > JanusGraph vs. Sphinx vs. SQLite vs. Stardog

System Properties Comparison JanusGraph vs. Sphinx vs. SQLite vs. Stardog

Please select another system to include it in the comparison.

Editorial information provided by DB-Engines

Name

Description

A Graph DBMS optimized for distributed clusters

It was forked from the latest code base of Titan in January 2017

Open source search engine for searching in data from different sources, e.g. relational databases

Widely used embeddable, in-process RDBMS

Enterprise Knowledge Graph platform and graph DBMS with high availability, high performance reasoning, and virtualization

Primary database model

DB-Engines Ranking measures the popularity of database management systems
Trend Chart

Score	1.85
Rank	#134	Overall
	#12	Graph DBMS

Score	5.97
Rank	#56	Overall
	#5	Search engines

Score	103.35
Rank	#10	Overall
	#7	Relational DBMS

Score	1.93
Rank	#121	Overall
	#10	Graph DBMS
	#6	RDF stores

Website

Technical documentation

docs.janusgraph.org

sphinxsearch.com/docs

www.sqlite.org/docs.html

docs.stardog.com

Developer

Linux Foundation; originally developed as Titan by Aurelius

Sphinx Technologies Inc.

Dwayne Richard Hipp

Stardog-Union

Initial release

2017

2001

2000

2010

Current release

1.0.0, October 2023

3.5.1, February 2023

3.46.1 (13 August 2024), August 2024

7.3.0, May 2020

License

Commercial or Open Source

Open Source

Apache 2.0

Open Source

GPL version 2, commercial licence available

Open Source

Public Domain

commercial

60-day fully-featured trial license; 1-year fully-featured non-commercial use license for academics/students

Cloud-based only

Only available as a cloud service

DBaaS offerings (sponsored links)

Database as a Service

Providers of DBaaS offerings, please contact us to be listed.

Implementation language

Java

C++

Java

Server operating systems

Linux
OS X
Unix
Windows

FreeBSD
Linux
NetBSD
OS X
Solaris
Windows

server-less

Linux
macOS
Windows

Data scheme

yes

dynamic column types

schema-free and OWL/RDFS-schema support

Typing

predefined data types such as float or date

yes

not rigid because of 'dynamic typing' concept.

yes

XML support

Some form of processing data in XML format, e.g. support for XML data structures, and/or support for XPath, XQuery or XSLT.

Import/export of XML data possible

Secondary indexes

yes

full-text index on all search fields

yes

supports real-time indexing in full-text and geospatial

SQL

Support of SQL

SQL-like query language (SphinxQL)

yes

SQL-92 is not fully supported

Yes, compatible with all major SQL variants through dedicated BI/SQL Server

APIs and other access methods

Java API
TinkerPop Blueprints
TinkerPop Frames
TinkerPop Gremlin
TinkerPop Rexster

Proprietary protocol

ADO.NET

inofficial driver
JDBC

inofficial driver
ODBC

inofficial driver

GraphQL query language
HTTP API
Jena RDF API
OWL
RDF4J API
Sesame REST HTTP Protocol
SNARL
SPARQL
Spring Data
Stardog Studio
TinkerPop 3

Supported programming languages

Clojure
Java
Python

C++

unofficial client library
Java
Perl

unofficial client library
PHP
Python
Ruby

unofficial client library

Actionscript
Ada
Basic
C
C#
C++
D
Delphi
Forth
Fortran
Haskell
Java
JavaScript
Lisp
Lua
MatLab
Objective-C
OCaml
Perl
PHP
PL/SQL
Python
R
Ruby
Scala
Scheme
Smalltalk
Tcl

.Net
Clojure
Groovy
Java
JavaScript
Python
Ruby

Server-side scripts

Stored procedures

yes

user defined functions and aggregates, HTTP Server extensions in Java

Triggers

yes

via event handlers

Partitioning methods

Methods for storing different data on different nodes

yes

depending on the used storage backend (e.g. Cassandra, HBase, BerkeleyDB)

Sharding

Partitioning is done manually, search queries against distributed index is supported

none

Replication methods

Methods for redundantly storing data on multiple nodes

yes

none

Multi-source replication in HA-Cluster

MapReduce

Offers an API for user-defined Map/Reduce methods

yes

via Faunus, a graph analytics engine

Consistency concepts

Methods to ensure consistency in a distributed system

Eventual Consistency
Immediate Consistency

Immediate Consistency in HA-Cluster

Foreign keys

Referential integrity

yes

Relationships in graphs

yes

relationships in graphs

Transaction concepts

Support to ensure data integrity after non-atomic manipulations of data

ACID

Concurrency

Support for concurrent manipulation of data

yes

via file-system locks

yes

Durability

Support for making data persistent

yes

Supports various storage backends: Cassandra, HBase, Berkeley DB, Akiban, Hazelcast

yes

The original contents of fields are not stored in the Sphinx index.

yes

In-memory capabilities

Is there an option to define some or all structures to be held in-memory only.

yes

User concepts

Access control

User authentification and security via Rexster Graph Server

Access rights for users and roles

More information provided by the system vendor

We invite representatives of system vendors to contact us for updating and extending the system information,
and for displaying vendor-provided information such as key customers, competitive advantages and market metrics.