DBMS > Fauna vs. Linter vs. OpenSearch vs. Titan

System Properties Comparison Fauna vs. Linter vs. OpenSearch vs. Titan

Please select another system to include it in the comparison.

Editorial information provided by DB-Engines

Name

Titan has been decommisioned after the takeover by Datastax. It will be removed from the DB-Engines ranking. A fork has been open-sourced as JanusGraph.

Description

Fauna provides a web-native interface, with support for GraphQL and custom business logic that integrates seamlessly with the rest of the serverless ecosystem. The underlying globally distributed storage and compute platform is fast, consistent, and reliable, with a modern security infrastructure.

RDBMS for high security requirements

A distributed, RESTful search and analytics engine forked from Elasticsearch and based on Apache Lucene

Titan is a Graph DBMS optimized for distributed clusters.

Primary database model

Document store
Graph DBMS
Relational DBMS
Time Series DBMS

Relational DBMS

Search engine

Graph DBMS

Secondary database models

Spatial DBMS

Vector DBMS

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

Score	1.52
Rank	#153	Overall
	#26	Document stores
	#14	Graph DBMS
	#71	Relational DBMS
	#13	Time Series DBMS

Score	0.09
Rank	#346	Overall
	#152	Relational DBMS

Score	16.36
Rank	#37	Overall
	#4	Search engines

Website

fauna.com

linter.ru

github.com/opensearch-project
opensearch.org

github.com/thinkaurelius/titan

Technical documentation

docs.fauna.com

opensearch.org/docs/latest

github.com/thinkaurelius/titan/wiki

Developer

Fauna, Inc.

relex.ru

Amazon Web Services

Aurelius, owned by DataStax

Initial release

2014

1990

2021

2012

Current release

2.5.0, January 2023

License

Commercial or Open Source

commercial

Open Source

Apache Version 2.0

Open Source

Apache license, version 2.0

Cloud-based only

Only available as a cloud service

yes

DBaaS offerings (sponsored links)

Database as a Service

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

STACKIT OpenSearch offers OpenSearch in a managed version in enterprise grade, 100% GDPR-compliant, for a wide range of applications like analytics, website search, offering scalability and fast data access.
Aiven for OpenSearch: Fully managed open source search and analytics suite. Out-of-the-box integrations get you up and running in a couple of clicks.

Implementation language

Scala

C and C++

Java

Server operating systems

hosted

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

All OS with a Java VM

Linux
OS X
Unix
Windows

Data scheme

schema-free

yes

schema-free

Flexible type definitions. Once a type is defined, it is persistent

yes

Typing

predefined data types such as float or date

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.

Secondary indexes

yes

All search fields are automatically indexed

yes

SQL

Support of SQL

yes

SQL-like query language

APIs and other access methods

RESTful HTTP API

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

Java API
RESTful HTTP/JSON API

Java API
TinkerPop Blueprints
TinkerPop Frames
TinkerPop Gremlin
TinkerPop Rexster

Supported programming languages

C#
Go
Java
JavaScript
Python
Ruby
Scala
Swift

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

Go
Java
JavaScript (Node.js)
PHP
Python
Ruby

Elasticsearch client

Clojure
Java
Python

Server-side scripts

Stored procedures

user defined functions

yes

proprietary syntax with the possibility to convert from PL/SQL

yes

Triggers

yes

by using the 'percolation' feature

yes

Partitioning methods

Methods for storing different data on different nodes

horizontal partitioning

consistent hashing

none

Sharding

yes

via pluggable storage backends

Replication methods

Methods for redundantly storing data on multiple nodes

Multi-source replication

Source-replica replication

yes

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

Immediate Consistency

Eventual Consistency

Synchronous doc based replication. Get by ID may show delays up to 1 sec. Configurable write consistency: one, quorum, all

Eventual Consistency
Immediate Consistency

Foreign keys

Referential integrity

yes

Relationships in graph

Transaction concepts

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

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

In-memory capabilities

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

User concepts

Access control

Identity management, authentication, and access control

fine grained access rights according to SQL-standard

User authentification and security via Rexster Graph Server

More information provided by the system vendor

Specific characteristics

OpenSearch is a highly scalable and extensible open-source software suite for search,...
» more

Competitive advantages

Distributed as fully open source under Apache License, Version 2.0 (ALv2), OpenSearch...
» more

Typical application scenarios

The OpenSearch platform is used across a broad range of search , analytics, and observability...
» more

Licensing and pricing models

The OpenSearch Project offers open source software licensed under Apache License...
» more

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.