NoSQL database comparison

1. WHICH NOSQL DATABASE ?
NoSQL database comparison
BY
Nitin Kumar
PHP Architect
+91 98 7373 1595
yanitin@gmail.com

2. INDEX
 Key Value database
 Document oriented database
 Column-oriented database
 Graph-oriented database

3. KEY VALUE DATABASE
 A key-value store provides the simplest possible
data model and is exactly what the name suggests:
it's a storage system that stores values indexed by
a key.


4. KEY VALUE DATABASE
 Use case: Fast access to a large number of
objects, such as caches or queues like mobile,
gaming, online ads.
 Limitation: Cannot update subset of a value, No
querying, Unique keys generation become complex
for large no of objects
 Database: Riak, MemcacheDB, Redis, DynamoDB

5. DOCUMENT ORIENTED DATABASE
 A document-oriented database extends the previous key-
value are stored in a structured format. The major benefit of
using a document database comes from the fact that while it
has all the benefits of a key/value store, you aren’t limited to
just querying by key.
The following example shows data values collected as a
“document” representing the names of specific person. Note
that while the two examples all represent details, the
representative models are different.

6. DOCUMENT ORIENTED DATABASE
 Use case: Manage large variety of objects that
differ in structure like product catalogs in e-
commerce, customer profiles, content management
applications
 Limitation: Query performance not linearly
scalable, Join queries across collections not
efficient
 Database: MongoDB, CouchDB

7. COLUMN ORIENTED DATABASE
 Column-oriented systems still use tables but have
no joins (joins must be handled within your
application). Obviously, they store data by column
as opposed to traditional row-oriented databases.
This makes aggregations much easier.

8. COLUMN ORIENTED DATABASE
 Use case: Storing a large number of time-stamped
data like event logs, sensor data,Analytics that
involve querying entire columns of data such as
trends or time series analytics
 Limitation: No join queries or sub-queries,
Ordering is done per partition, specified at table
creation time
 Database: Cassandra, BigTable, HBase

9. GRAPH BASED DATABASE
 The graph based DBMS models represent the data
in a completely different way than the previous
three models. They use tree-like structures (i.e.
graphs) with nodes and edges connecting each
other through relations.

10. GRAPH BASED DATABASE
 Use case: objects with a large number of inter-
relations like social networking friends-networks,
hierarchical role based permissions.
 Limitation: Difficult to scale for large data sets for
generic graphs, Giraph uses the Bulk Synchronous
Parallel model to overcome some of the scalability
limitations
 Database: Neo4J, OrientDB, Apache Giraph,
AllegroGraph

11. FOR QUERY CONTACT
Nitin Kumar
PHP Architect
+91 98 7373 1595
yanitin@gmail.com