A Qualitative Comparison of NoSQL Data Stores
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2019, Vol 10, Issue 2
Abstract
Due to the proliferation of big data with large volume, velocity, complexity, and distribution among remote servers, it became obvious that traditional relational databases are unsuitable for meeting the requirements of such data. This led to the emergence of a novel technology among organizations and business enterprises; NoSQL datastores. Today such datastores have become popular alternatives to traditional relational databases, since their schema-less data models can manipulate and handle a huge amount of structured, semi-structured and unstructured data, with high speed and immense distribution. Those data stores are of four basic types, and numerous instances have been developed under each type. This implies the need to understand the differences among them and how to select the most suitable one for any given data. Unfortunately, research efforts in the literature either consider differences from a theoretical point of view (without real use cases), or address performance issues such as speed and storage, which is insufficient to give researchers deep insight into the mapping of a given data structure to a given NoSQL datastore type. Hence, this paper provides a qualitative comparison among three popular datastores of different types (Redis, Neo4j, and MongoDB) using a real use case of each type, translated to the others. It thus highlights the inherent differences among them, and hence what data structures each of them suits most.
Authors and Affiliations
Sarah H. Kamal, Hanan H. Elazhary, Ehab E. Hassanein
Keywords
Related Articles
- EP ID EP468382
- DOI 10.14569/IJACSA.2019.0100244
- Views 105
- Downloads 0
Breast Cancer Classification in Histopathological Images using Convolutional Neural Network
Computer based analysis is one of the suggested means that can assist oncologists in the detection and diagnosis of breast cancer. On the other hand, deep learning has been promoted as one of the hottest research directi...
Construction of TVET M-Learning Model based on Student Learning Style
Mobile learning or m-learning is emerging as the innovation of virtual learning that used mobile devices for teaching and learning which can be accessed readily at hand anywhere either in classroom or group. Whereas prel...
Most Valuable Player Algorithm for Solving Minimum Vertex Cover Problem
Minimum Vertex Cover Problem (MVCP) is a combinatorial optimization problem that is utilized to formulate multiple real-life applications. Owing to this fact, abundant research has been undertaken to discover valuable MV...
Developement of Bayesian Networks from Unified Modeling Language for Learner Modelling
First of all, and to clarify our purpose, it seems important to say that the work we are presenting here lie within the framework of learner modeling in an adaptive system understood as computational modeling of the lear...
Distributed Swarm Optimization Modeling for Waste Collection Vehicle Routing Problem
In this paper, we consider a complex garbage collection problem, where the residents of a particular area dispose of recyclable garbage, which is collected and managed using a fleet of trucks with different weight capaci...