NoSQL Database Classification: New Era of Databases for Big Data

NoSQL Database Classification: New Era of Databases for Big Data

Biswaranjan Acharya, Ajaya Kumar Jena, Jyotir Moy Chatterjee, Raghvendra Kumar, Dac-Nhuong Le
Copyright: © 2019 |Pages: 16
DOI: 10.4018/IJKBO.2019010105
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

The rapid growth in the digital world in form of exponentiation to accommodate huge amount of structured, semi-structured, unstructured and hybrid data received from different sources. By using the conventional data management tools, it is quite impossible to manage this semi-structured and unstructured data for which a non-relational database management system such as NoSQL and NewSQL are used to handle such types of data. These types of semi-structured and structured data are generally considered ‘Big Data.' This article describes the basic characteristics, background and the models of NoSQL used for big data applications. In this work, the authors surveyed different NoSQL characteristics used by the researchers and try to compare the strength and weakness of different NoSQL databases.
Article Preview
Top

2. Background

The basic goal of Relational Database Management System (DBMS) is to use data processing in business applications to store the business transactions data, financial records and personal data related to an organisation (Browne). The traditional database stores the data in the form of relational tables which is applicable only for structured data. So there is a challenge to deal with semi-structured and unstructured data (Han, Haihong & Le et al., 2011). As a result of which people have adopted variety of non-relational databases referred as NoSQL (Du et al., 2010).The primary advantages of NoSql are mainly quick accessibility, storing massive data and also easy to expand with low cost (Tudorica & Burcer, 2011). The characteristics of NoSQL database can be given in Figure 1.

Figure 1.

Characteristics of NoSQL database

IJKBO.2019010105.f01

The CAP theorem described the conflicts between the distinctive parts of high accessibility in dispersed frameworks that are not completely feasible (Potter, 1985):

Complete Article List

Search this Journal:
Reset
Volume 14: 1 Issue (2024)
Volume 13: 1 Issue (2023)
Volume 12: 4 Issues (2022): 3 Released, 1 Forthcoming
Volume 11: 4 Issues (2021)
Volume 10: 4 Issues (2020)
Volume 9: 4 Issues (2019)
Volume 8: 4 Issues (2018)
Volume 7: 4 Issues (2017)
Volume 6: 4 Issues (2016)
Volume 5: 4 Issues (2015)
Volume 4: 4 Issues (2014)
Volume 3: 4 Issues (2013)
Volume 2: 4 Issues (2012)
Volume 1: 4 Issues (2011)
View Complete Journal Contents Listing