DBMS > Faircom DB vs. Google BigQuery vs. Greenplum vs. Sphinx

System Properties Comparison Faircom DB vs. Google BigQuery vs. Greenplum vs. Sphinx

Please select another system to include it in the comparison.

Editorial information provided by DB-Engines

Name

Description

Native high-speed multi-model DBMS for relational and key-value store data simultaneously accessible through SQL and NoSQL APIs.

Large scale data warehouse service with append-only tables

Analytic Database platform built on PostgreSQL. Full name is Pivotal Greenplum Database

A logical database in Greenplum is an array of individual PostgreSQL databases working together to present a single database image.

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

Primary database model

Key-value store
Relational DBMS

Relational DBMS

Search engine

Secondary database models

Document store
Spatial DBMS

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

Score	0.18
Rank	#314	Overall
	#45	Key-value stores
	#141	Relational DBMS

Score	52.67
Rank	#19	Overall
	#13	Relational DBMS

Score	7.71
Rank	#46	Overall
	#29	Relational DBMS

Score	5.97
Rank	#56	Overall
	#5	Search engines

Website

www.faircom.com/products/faircom-db

cloud.google.com/bigquery

greenplum.org

sphinxsearch.com

Technical documentation

docs.faircom.com/docs/en/UUID-7446ae34-a1a7-c843-c894-d5322e395184.html

cloud.google.com/bigquery/docs

docs.greenplum.org

sphinxsearch.com/docs

Developer

FairCom Corporation

Google

Pivotal Software Inc.

Sphinx Technologies Inc.

Initial release

1979

2010

2005

2001

Current release

V13, July 2024

7.0.0, September 2023

3.5.1, February 2023

License

Commercial or Open Source

commercial

Restricted, free version available

commercial

Open Source

Apache 2.0

Open Source

GPL version 2, commercial licence available

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.

Implementation language

ANSI C, C++

C++

Server operating systems

AIX
FreeBSD
HP-UX
Linux
NetBSD
OS X
QNX
SCO
Solaris
VxWorks
Windows

easily portable to other OSs

hosted

Linux

FreeBSD
Linux
NetBSD
OS X
Solaris
Windows

Data scheme

schema free, schema optional, schema required, partial schema,

yes

Typing

predefined data types such as float or date

yes, ANSI SQL Types, JSON, typed binary structures

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

since Version 4.2

Secondary indexes

yes

full-text index on all search fields

SQL

Support of SQL

yes, ANSI SQL with proprietary extensions

yes

SQL-like query language (SphinxQL)

APIs and other access methods

ADO.NET
Direct SQL
JDBC
JPA
ODBC
RESTful HTTP/JSON API
RESTful MQTT/JSON API
RPC

RESTful HTTP/JSON API

JDBC
ODBC

Proprietary protocol

Supported programming languages

.Net
C
C#
C++
Java
JavaScript (Node.js and browser)
PHP
Python
Visual Basic

.Net
Java
JavaScript
Objective-C
PHP
Python
Ruby

C
Java
Perl
Python
R

C++

unofficial client library
Java
Perl

unofficial client library
PHP
Python
Ruby

unofficial client library

Server-side scripts

Stored procedures

yes

.Net, JavaScript, C/C++

user defined functions

in JavaScript

yes

Triggers

yes

Partitioning methods

Methods for storing different data on different nodes

File partitioning, horizontal partitioning, sharding

Customizable business rules for table partitioning

none

Sharding

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

Replication methods

Methods for redundantly storing data on multiple nodes

yes, configurable to be parallel or serial, synchronous or asynchronous, uni-directional or bi-directional, ACID-consistent or eventually consistent (with custom conflict resolution).

Source-replica replication

none

MapReduce

Offers an API for user-defined Map/Reduce methods

yes

Consistency concepts

Methods to ensure consistency in a distributed system

Eventual Consistency
Immediate Consistency
Tunable consistency per server, database, table, and transaction

Immediate Consistency

Foreign keys

Referential integrity

yes

Transaction concepts

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

tunable from ACID to Eventually Consistent

Since BigQuery is designed for querying data

ACID

Concurrency

Support for concurrent manipulation of data

yes

Durability

Support for making data persistent

Yes, tunable from durable to delayed durability to in-memory

yes

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

In-memory capabilities

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

yes

User concepts

Access control

Fine grained access rights according to SQL-standard with additional protections for files

Access privileges (owner, writer, reader) on dataset, table or view level

Google Cloud Identity & Access Management (IAM)

fine grained access rights according to SQL-standard

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.