DBMS > Firebird vs. JanusGraph vs. Microsoft SQL Server vs. OpenSearch

System Properties Comparison Firebird vs. JanusGraph vs. Microsoft SQL Server vs. OpenSearch

Please select another system to include it in the comparison.

Editorial information provided by DB-Engines

Name

Description

Firebird is an open source RDBMS forked from Borland's InterBase

A Graph DBMS optimized for distributed clusters

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

Microsofts flagship relational DBMS

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

Primary database model

Secondary database models

Document store
Graph DBMS
Spatial DBMS

Vector DBMS

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

Score	20.82
Rank	#30	Overall
	#18	Relational DBMS

Score	1.94
Rank	#129	Overall
	#12	Graph DBMS

Score	824.29
Rank	#3	Overall
	#3	Relational DBMS

Score	16.36
Rank	#37	Overall
	#4	Search engines

Website

www.firebirdsql.org

janusgraph.org

www.microsoft.com/en-us/sql-server

github.com/opensearch-project
opensearch.org

Technical documentation

www.firebirdsql.org/en/reference-manuals

docs.janusgraph.org

learn.microsoft.com/en-US/sql/sql-server

opensearch.org/docs/latest

Developer

Firebird Foundation

Linux Foundation; originally developed as Titan by Aurelius

Microsoft

Amazon Web Services

Initial release

2000

As fork of Borland's InterBase

2017

1989

2021

Current release

5.0.0, January 2024

0.6.3, February 2023

SQL Server 2022, November 2022

2.5.0, January 2023

License

Commercial or Open Source

Open Source

Initial Developer's Public License

Open Source

Apache 2.0

commercial

restricted free version is available

Open Source

Apache 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.

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

C and C++

Java

C++

Java

Server operating systems

AIX
FreeBSD
HP-UX
Linux
OS X
server-less

Firebird Embedded Server
Solaris
Unix
Windows

Linux
OS X
Unix
Windows

Linux
Windows

All OS with a Java VM

Data scheme

yes

schema-free

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

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.

yes

Secondary indexes

yes

All search fields are automatically indexed

SQL

Support of SQL

yes

SQL-like query language

APIs and other access methods

ADO.NET
C/C++ API
JDBC

Jaybird
ODBC
OLE DB

Java API
TinkerPop Blueprints
TinkerPop Frames
TinkerPop Gremlin
TinkerPop Rexster

ADO.NET
JDBC
ODBC
OLE DB
Tabular Data Stream (TDS)

Java API
RESTful HTTP/JSON API

Supported programming languages

C
C#
C++
Delphi
Java
JavaScript

Node.js
Lua
Perl
PHP
Python
Ruby

Clojure
Java
Python

C#
C++
Delphi
Go
Java
JavaScript (Node.js)
PHP
Python
R
Ruby
Visual Basic

Go
Java
JavaScript (Node.js)
PHP
Python
Ruby

Elasticsearch client

Server-side scripts

Stored procedures

PSQL

yes

Transact SQL, .NET languages, R, Python and (with SQL Server 2019) Java

yes

Triggers

yes

by using the 'percolation' feature

Partitioning methods

Methods for storing different data on different nodes

none

yes

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

tables can be distributed across several files (horizontal partitioning); sharding through federation

Sharding

Replication methods

Methods for redundantly storing data on multiple nodes

Source-replica replication

yes

yes, but depending on the SQL-Server Edition

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

Eventual Consistency
Immediate Consistency

Immediate Consistency

Eventual Consistency

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

Foreign keys

Referential integrity

yes

Relationships in graphs

yes

Transaction concepts

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

ACID

Concurrency

Support for concurrent manipulation of data

yes

Features a multi-generational MVCC architecture, readers do not block writers

yes

Durability

Support for making data persistent

yes

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

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

Users with fine-grained authorization concept

User authentification and security via Rexster Graph Server

fine grained access rights according to SQL-standard

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.