A comparative study: MongoDB vs. MySQL

Abstract-In this article we present a comparative study between the usage capabilities of MongoDB, a non-relational database, and MySQL's usage capabilities, a relational database, as a back-end for an online platform. We will also present the advantages of using a non-relational database, namely MongoDB, compared to a relational database, namely MySQL, integrated in an online platform, which allows users to publish different articles, books, magazines and so on, and also gives them the possibility to share online their items with other people. Nowadays, most applications have thousands of users that perform operations simultaneously thus, it takes more than one operation to be executed at a time, to really see the differences between the two databases. This paper aims to highlight the differences between MySQL and MongoDB, integrated in an online platform, when various operations were executed in parallel by many users.

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Comparative Study Between the Capabilities of MySQl Vs. MongoDB as a Back-End for an Online Platform

Győrödi¹,

Győrödi²,

Andrada³

et al. 2016

“…A few years ago an application normally only used to have thousands of users to tens of thousands of users in the most extreme cases, and currently there are applications that have millions of users and amount of data is increasing, so is very important to perform efficient search to get relevant information from data [7]. It is important to use search engines to access information, that has grown tremendously based on the needs of users [2].…”

Section: Introductionmentioning

confidence: 99%

A Novel Representation and Searching Algorithm for Opening Hours

Husar¹,

Győrödi²,

Győrödi³

et al. 2017

Abstract-OpeningHours can be considered a data type having a human representation; this means that it can be easily understood by human beings and hardly understood by computers because the lack of a standard structured representation. In essence, the opening hours gives us a simple information: opening state at a certain date and time, and this is our focus in this paper. So far, this kind of functionality does not exists in today's database management systems because there are no algorithms developed in this way. The purpose of this paper is to presents a novel and easy to implement algorithm for encoding opening hours in order to quickly search and get the opening state for records.

“…To handle a huge volume of data like the internet, multimedia and social media the use of traditional relational databases is inefficient. Thus, more and more applications are beginning to use a non-relational database because they provide a more flexible structure that can shape after each user' needs; they are designed to store large amounts of data, and they have denormalized databases, which increases performance [6].…”

Section: Introductionmentioning

confidence: 99%

Improve Query Performance On Hierarchical Data. Adjacency List Model Vs. Nested Set Model

Győrödi¹,

Moldovan-Duse²,

Győrödi³

et al. 2016

Self Cite

Abstract-Hierarchical data are found in a variety of database applications, including content management categories, forums, business organization charts, and product categories. In this paper, we will examine two models deal with hierarchical data in relational databases namely, adjacency list model and nested set model. We analysed these models by executing various operations and queries in a web-application for the management of categories, thus highlighting the results obtained during performance comparison tests. The purpose of this paper is to present the advantages and disadvantages of using an adjacency list model compared to nested set model in a relational database integrated into an application for the management of categories, which needs to manipulate a big amount of hierarchical data.