DBMS > Elasticsearch vs. Sphinx vs. SQLite vs. Titan

System Properties Comparison Elasticsearch vs. Sphinx vs. SQLite 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

A distributed, RESTful modern search and analytics engine based on Apache Lucene

Elasticsearch lets you perform and combine many types of searches such as structured, unstructured, geo, and metric

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

Widely used embeddable, in-process RDBMS

Titan is a Graph DBMS optimized for distributed clusters.

Primary database model

Search engine

Relational DBMS

Graph DBMS

Secondary database models

Document store
Spatial DBMS
Vector DBMS

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

Score	135.35
Rank	#7	Overall
	#1	Search engines

Score	5.98
Rank	#56	Overall
	#5	Search engines

Score	114.32
Rank	#10	Overall
	#7	Relational DBMS

Website

www.elastic.co/elasticsearch

sphinxsearch.com

www.sqlite.org

github.com/thinkaurelius/titan

Technical documentation

www.elastic.co/guide/en/elasticsearch/reference/current/index.html

sphinxsearch.com/docs

www.sqlite.org/docs.html

github.com/thinkaurelius/titan/wiki

Developer

Elastic

Sphinx Technologies Inc.

Dwayne Richard Hipp

Aurelius, owned by DataStax

Initial release

2010

2001

2000

2012

Current release

8.6, January 2023

3.5.1, February 2023

3.45.3 (15 April 2024), April 2024

License

Commercial or Open Source

Open Source

Elastic License

Open Source

GPL version 2, commercial licence available

Open Source

Public Domain

Open Source

Apache license, version 2.0

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

All OS with a Java VM

FreeBSD
Linux
NetBSD
OS X
Solaris
Windows

server-less

Linux
OS X
Unix
Windows

Data scheme

schema-free

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

yes

dynamic column types

yes

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.

Secondary indexes

yes

All search fields are automatically indexed

yes

full-text index on all search fields

yes

SQL

Support of SQL

SQL-like query language

SQL-like query language (SphinxQL)

yes

SQL-92 is not fully supported

APIs and other access methods

Java API
RESTful HTTP/JSON API

Proprietary protocol

ADO.NET

inofficial driver
JDBC

inofficial driver
ODBC

inofficial driver

Java API
TinkerPop Blueprints
TinkerPop Frames
TinkerPop Gremlin
TinkerPop Rexster

Supported programming languages

.Net
Groovy
Community Contributed Clients
Java
JavaScript
Perl
PHP
Python
Ruby

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

Clojure
Java
Python

Server-side scripts

Stored procedures

yes

Triggers

yes

by using the 'percolation' feature

yes

Partitioning methods

Methods for storing different data on different nodes

Sharding

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

none

yes

via pluggable storage backends

Replication methods

Methods for redundantly storing data on multiple nodes

yes

none

yes

MapReduce

Offers an API for user-defined Map/Reduce methods

ES-Hadoop Connector

yes

via Faunus, a graph analytics engine

Consistency concepts

Methods to ensure consistency in a distributed system

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

via file-system locks

yes

Durability

Support for making data persistent

yes

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

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.

Memcached and Redis integration

yes

User concepts

Access control

User authentification and security via Rexster Graph Server

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.