DBMS > JanusGraph vs. Linter vs. Manticore Search vs. Oracle vs. TigerGraph

System Properties Comparison JanusGraph vs. Linter vs. Manticore Search vs. Oracle vs. TigerGraph

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

RDBMS for high security requirements

Multi-storage database for search, including full-text search.

Widely used RDBMS

A complete, distributed, parallel graph computing platform supporting web-scale data analytics in real-time

Primary database model

Secondary database models

Spatial DBMS

Time Series DBMS

using the Manticore Columnar Library

Document store
Graph DBMS

with Oracle Spatial and Graph
RDF store

with Oracle Spatial and Graph
Spatial DBMS

with Oracle Spatial and Graph
Vector DBMS

since Oracle 23

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

Score	1.94
Rank	#129	Overall
	#12	Graph DBMS

Score	0.09
Rank	#346	Overall
	#152	Relational DBMS

Score	0.22
Rank	#312	Overall
	#21	Search engines

Score	1236.29
Rank	#1	Overall
	#1	Relational DBMS

Score	1.83
Rank	#139	Overall
	#13	Graph DBMS

Website

janusgraph.org

linter.ru

manticoresearch.com

www.oracle.com/database

www.tigergraph.com

Technical documentation

docs.janusgraph.org

manual.manticoresearch.com

docs.oracle.com/en/database

docs.tigergraph.com

Developer

Linux Foundation; originally developed as Titan by Aurelius

relex.ru

Manticore Software

Oracle

Initial release

2017

1990

2017

1980

2017

Current release

0.6.3, February 2023

6.0, February 2023

23c, September 2023

License

Commercial or Open Source

Open Source

Apache 2.0

commercial

Open Source

GPL version 2

commercial

restricted free version is available

commercial

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 and C++

C++

C and C++

C++

Server operating systems

Linux
OS X
Unix
Windows

AIX
Android
BSD
HP Open VMS
iOS
Linux
OS X
VxWorks
Windows

FreeBSD
Linux
macOS
Windows

AIX
HP-UX
Linux
OS X
Solaris
Windows
z/OS

Linux

Data scheme

yes

Fixed schema

yes

Schemaless in JSON and XML columns

yes

Typing

predefined data types such as float or date

yes

Int, Bigint, Float, Timestamp, Bit, Int array, Bigint array, JSON, Boolean

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.

Can index from XML

yes

Secondary indexes

yes

full-text index on all search fields

yes

SQL

Support of SQL

yes

SQL-like query language

yes

with proprietary extensions

SQL-like query language (GSQL)

APIs and other access methods

Java API
TinkerPop Blueprints
TinkerPop Frames
TinkerPop Gremlin
TinkerPop Rexster

ADO.NET
JDBC
LINQ
ODBC
OLE DB
Oracle Call Interface (OCI)

Binary API
RESTful HTTP/JSON API
RESTful HTTP/SQL API
SQL over MySQL

JDBC
ODBC
ODP.NET
Oracle Call Interface (OCI)

GSQL (TigerGraph Query Language)
Kafka
RESTful HTTP/JSON API

Supported programming languages

Clojure
Java
Python

C
C#
C++
Java
Perl
PHP
Python
Qt
Ruby
Tcl

Elixir
Go
Java
JavaScript (Node.js)
Perl
PHP
Python

C
C#
C++
Clojure
Cobol
Delphi
Eiffel
Erlang
Fortran
Groovy
Haskell
Java
JavaScript
Lisp
Objective C
OCaml
Perl
PHP
Python
R
Ruby
Scala
Tcl
Visual Basic

C++
Java

Server-side scripts

Stored procedures

yes

proprietary syntax with the possibility to convert from PL/SQL

user defined functions

PL/SQL

also stored procedures in Java possible

yes

Triggers

yes

Partitioning methods

Methods for storing different data on different nodes

yes

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

none

Sharding

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

Sharding, horizontal partitioning

Replication methods

Methods for redundantly storing data on multiple nodes

yes

Source-replica replication

Synchronous replication based on Galera library

Multi-source replication
Source-replica replication

MapReduce

Offers an API for user-defined Map/Reduce methods

yes

via Faunus, a graph analytics engine

can be realized in PL/SQL

yes

Consistency concepts

Methods to ensure consistency in a distributed system

Eventual Consistency
Immediate Consistency

Immediate Consistency

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

yes

isolated transactions for atomic changes and binary logging for safe writes

ACID

isolation level can be parameterized

ACID

Concurrency

Support for concurrent manipulation of data

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 Manticore index.

yes

In-memory capabilities

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

yes

Version 12c introduced the new option 'Oracle Database In-Memory'

User concepts

Access control

User authentification and security via Rexster Graph Server

fine grained access rights according to SQL-standard

Role-based access control

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.