A Comparison Between Relational Databases and NoSQL Databases
A Comparison Between Relational Databases and NoSQL Databases
Behjat U Nisa
M.Tech
Tech Scholar, Department of CSE, Swami Devi Dyal Group of Professional Institutes, Haryana, India
@ IJTSRD | Available Online @ www.ijtsrd.com | Volume – 2 | Issue – 3 | Mar-Apr 2018 Page: 846
International Journal of Trend in Scientific Research and Development (IJTSRD) ISSN: 2456-6470
B. Column Oriented Databases
Column oriented databases as the name suggests store
the data in the form of columns. In column stores,
each key is associated with one or more attributes.
Column data can be written efficiently and replace old
data without altering any other columns for the rows.
It offers high scalability in data storage. Column
oriented databases are suitable for data mining and
analytic applications. Some of the column store
databases used are BigTable, Cassandra and HBase.
Some of the features of NoSQL are as follows: Document store databases are also known as
‘Document Oriented Databases’. The data is stored
1. Ability to scale horizontally. and organized in the form of documents. These
2. Replicate and distribute data over different documents are in some ways similar to the records in
servers. relational databases but more flexible and schema-
3. Weaker concurrency model than ACID less. The documents are in standard formats like
4. Flexible schema XML, PDF or JSON. The documents are represented
5. Efficient use of distributed indexes and RAM by a unique key which is a simple string or a URI or
6. Adding new attributes to data records path. They offer great performance. Each document
Types of NOSQL Databases: may store similar as well as dissimilar data. These
data stores are slightly more complex than the key
NoSQL databases can be classified into five types: value data stores. They can be used for content
management system and blog software. Examples of
1. Key-value store databases document databases include MongoDB, Apache
2. Column oriented databases CouchDB.
3. Document store databases
4. Graph databases D. Graph Databases
5. Object oriented databases
Graph databases store data in the form of graphs in a
Each database is individually good at dealing with schema-less manner. The graphs consist of nodes,
size and complexities. edges and properties. Nodes represent entities like
people and objects, edges represent the relationships
A. Key – Value Store Databases between these nodes and properties contain any
Key-value Store databases: The key-value data stores information pertinent to the nodes. It provides an
are simple but efficient and powerful. They allow data efficient way to store semi structured data. These
to be stored in a schema-less manner. The data as the databases are faster than the relational databases as
name suggests consists of two parts a key which is a queries are expressed as traversals. Graph databases
unique identifier to a particular data entry and a value support ACID properties. They can be used in social
that corresponds to the key. The data can be any networking applications, network and cloud
primitive of a programming language or it can be an management, bioinformatics etc. An example of graph
object. It has a simple API. It favors high scalability database is the Neo4j.
over consistency. These data stores are like hash E. Object Oriented Databases
tables where keys are used as indexes thus the query
speed is higher than a relational database. The stores Object oriented database also called OODBMS is a
can hold structured as well as unstructured data. database in which data is stored in the form of objects.
These data stores can be used to save a user’s session It is considered to be a combination of database
or user’s shopping cart. Some of key value stores principles and object oriented programming. All the
available in market are Berkeley DB, Tokyo Tyrant, features of object oriented programming i.e.
and Amazon Dynamo. encapsulation, abstraction, polymorphism and
@ IJTSRD | Available Online @ www.ijtsrd.com | Volume – 2 | Issue – 3 | Mar-Apr 2018 Page: 847
International Journal of Trend in Scientific Research and Development (IJTSRD) ISSN: 2456-6470
inheritance are provided by the object oriented data 3) Leavitt, N.,"Will NoSQL Databases Live Up to
store. Objects have an identifier which uniquely Their Promise?" Computer, vol.43, no.2, pp.12-
represent it. Object oriented databases provide faster 14, Feb. 2010doi: 10.1109/MC.2010.58
access to data as objects are accessed using pointers.
4) MongoDB,
These databases are used in scientific research,
http://www.mongodb.org/about/introduction/
computer aided design etc. Example of object oriented
database is Db4o. 5) Clarence J M Tauro, Aravindh S, Shreeharsha A.
B, “Comparative Study of the New Generation,
IV. Relational Database and NoSQL Agile, Scalable, High Performance NOSQL
Databases”, International Journal of Computer
A. Advantages of NOSQL over Relational Databases
Applications (0975 – 888) Volume 48– No.20,
1. Easily scalable. June 2012 doi:10.5120/7461- 0336
2. Database administrators are not required 6) http://en.wikipedia.org/wiki/NoSQL
3. Structured , semi structured and unstructured
data can be stored 7) Vatika Sharma, Menu Dave, “SQL and NoSQL
4. Some databases are programmed to handle Databases”, International Journal of Advanced
hardware failures Research in Computer Science and Software
5. Faster, more efficient and flexible. Engineering, Volume 2, Issue 8, August 2012
8) Dr.K.Chitra, B.JeevaRani, “Study on Basically
B. Disadvantages of NOSQL over Relational
Available, Scalable and Eventually Consistent
Databases
NOSQL Databases”, International Journal of
1. There is no standard query language Advanced Research in Computer Science and
2. Maintenance is difficult Software Engineering, Volume 3, Issue 7, July
3. Some databases do not follow the ACID 2013
properties 9) Pramod J. Sadalage and Martin Fowler, “NoSQL
Distilled”
V. Conclusion
10) Riak, http://basho.com/technology/why-use-riak/
A general comparison has been made between
11) Jing Han; Haihong, E.; Guan Le; Jian Du; ,
relational databases and NoSQL databases. Each
"Survey on NoSQL database," Pervasive
NoSQL data store addresses the various problems in
Computing and Applications (ICPCA), 2011 6th
relational databases. High availability, high scalability
International Conference on , vol., no., pp.363-
and fault tolerance are provided by them. The
366, 26-28 Oct. 2011 doi: 10.1109/
different data stores use different techniques to
ICPCA.2011.6106531
achieve this goal and seem to suit well for their
requirements. The limitations of relational databases 12) Fay Chang, Jeffrey Dean, Sanjay Ghemawat,
and the advantages of NoSQL database have been Wilson C. Hsieh, Deborah A. Wallach Mike
discussed. The users can select various data models as Burrows, Tushar Chandra, Andrew Fikes, Robert
per their needs. There is some trade-off between E. Gruber,” Bigtable: A Distributed Storage
speed and reliability. NoSQL is flexible compared to System for Structured Data”, Google Inc
relational databases. 13) Apache CouchDB,
References: http://wiki.apache.org/couchdb/
14) Amazon DynamoDB,
1) Codd, Edgar F.: A Relational Model of Data for http://aws.amazon.com/dynamodb/
Large Shared Data Banks. In: Communications of
the ACM 13 (1970), June, No. 6, p. 377–387 15) Neo4j, http://www.neo4j.org/learn
2) Uma Bhat, Shraddha Jadhav, "Moving Towards 16) Apache Cassandra,
Non-Relational Databases "©2010 International http://wiki.apache.org/cassandra/
Journal of Computer Applications (0975 – 8887) 17) Rabi Prasad Padhy et al., International Journal of
Volume 1– No. 13 Advanced Engineering Sciences and
Technologies, Vol No. 11, Issue No. 1, 015 - 030
@ IJTSRD | Available Online @ www.ijtsrd.com | Volume – 2 | Issue – 3 | Mar-Apr 2018 Page: 848