scholarly journals Performance Comparison of NOSQL Database Cassandra and SQL Server for Large Databases

2016 ◽  
Vol 14 (2) ◽  
Author(s):  
Khalid Mahmood ◽  
Keyword(s):  
Performance Comparison ◽  
Sql Server ◽  
Nosql Database ◽  
Large Databases

IMIDB: An Algorithm for Indexed Mining of Incremental Databases

2017 ◽  
Vol 26 (1) ◽  
pp. 69-85
Author(s):  
Mohammed M. Fouad ◽  
Mostafa G.M. Mostafa ◽  
Abdulfattah S. Mashat ◽  
Tarek F. Gharib
Keyword(s):  
Data Structure ◽  
Association Rules ◽  
Efficient Algorithm ◽  
Performance Comparison ◽  
Incremental Mining ◽  
Itemset Mining ◽  
Large Databases ◽  
Transactional Databases ◽  
Dynamic Databases ◽  
Database Size

AbstractAssociation rules provide important knowledge that can be extracted from transactional databases. Owing to the massive exchange of information nowadays, databases become dynamic and change rapidly and periodically: new transactions are added to the database and/or old transactions are updated or removed from the database. Incremental mining was introduced to overcome the problem of maintaining previously generated association rules in dynamic databases. In this paper, we propose an efficient algorithm (IMIDB) for incremental itemset mining in large databases. The algorithm utilizes the trie data structure for indexing dynamic database transactions. Performance comparison of the proposed algorithm to recently cited algorithms shows that a significant improvement of about two orders of magnitude is achieved by our algorithm. Also, the proposed algorithm exhibits linear scalability with respect to database size.

scholarly journals Performance Comparison of Asymmetric Cryptography (Case study- Mail message)

2019 ◽  
Vol 4 (3) ◽  
pp. 105-111
Author(s):  
Zarni Sann ◽  
Thi thi Soe ◽  
Kaythi Wyut Mhone Knin ◽  
Zin May Win
Keyword(s):  
Computation Time ◽  
Performance Comparison ◽  
Sql Server ◽  
Sensitive Data ◽  
Rsa Algorithm ◽  
Mail Server ◽  
C Programming ◽  
Elgamal Encryption ◽  
Server System

Encryption is a well known technology for protecting sensitive data. ElGamal encryption and RSA algorithm is made before storing mails to mail server. ElGamal decryption and RSA decryption is made after retrieving mails from mail server. This system is implemented to secure mail server system for local government’s important mail messages. These algorithms consume a considerable amount of time and resources such as memory, CPU time, and computation time to encrypt and decrypt data. In this paper, the results are comparison of these algorithms in term of encryption time, decryption time, and memory usage over variable file sizes. After processing, it is proven that RSA performs a faster encryption process than ElGamal. However, ElGamal decryption process is faster than RSA. This system is also expressed comparison of storage Size between RSA and ElGamal. Both of these algorithms are cryptographic public-key algorithms but have functions in different ways. This system is using C# programming language and SQL Server to store mail messages.

Research of Load Balancing Based on NOSQL Database

2014 ◽  
Vol 602-605 ◽  
pp. 3371-3374
Author(s):  
Peng Wang ◽  
Yan Qi
Keyword(s):  
Load Balancing ◽  
Distributed Storage ◽  
Storage System ◽  
Sql Server ◽  
Distributed Storage System ◽  
Nosql Database ◽  
Consistent Hashing ◽  
Cache Hit Ratio ◽  
Hashing Algorithm ◽  
Balancing Principle

The NOSQL database to support data and high concurrent read and write,scalability and high availability features in a distributed storage system which has been applied widely. In this paper, through the research of load balancing in distributed storage system,and it proposes the consistent hashing algorithm and the virtual node strategy, in order to improve the load balancing of the system and increase the cache hit ratio. For the load balancing principle of NOSQL and SQL Server, analysis and comparison of the experimental data.The result shows that, with the increase of the number of virtual nodes, the cache hit ratio of NOSQL is higher than the cache hit ratio of SQL Server.

scholarly journals PERBANDINGAN PERFORMANSI DATABASE MONGODB DAN MYSQL DALAM APLIKASI FILE MULTIMEDIA BERBASIS WEB

2018 ◽  
Vol 6 (1) ◽  
pp. 63
Author(s):  
Mesri Silalahi
Keyword(s):  
Data Storage ◽  
Information Needs ◽  
Relational Databases ◽  
Performance Comparison ◽  
Web Based ◽  
File Storage ◽  
Nosql Database ◽  
Computer Resources ◽  
Important Building Block ◽  
Multimedia File

Database appeared and began to develop in line with the needs of processing and data storage to meet the information needs. Database is part of an important building block in an information system. In addition to a relational database (SQL), which stores structured datas in tables with defined schemes, there is a non-relational databases (NoSQL) with a dynamic scheme or unstructured. This study will compare the performance between NoSQL database (MongoDB) and SQL database (MySQL) for a web-based multimedia file storage application that stores files as BLOBs. Performance comparison is based on the speed of execution and the computer resources usage (CPU, memory, and virtual memory).

Designing and Development of the Aerial Surveying Digital Data Management Information System Based on Two-Tier C/S Structure Model

2012 ◽  
Vol 610-613 ◽  
pp. 3702-3707
Author(s):  
De Ying Ma ◽  
Hong Bin Lai
Keyword(s):  
Information System ◽  
Data Management ◽  
Management Information System ◽  
Digital Data ◽  
Sql Server ◽  
Data Management System ◽  
Management Information ◽  
Sql Server 2000 ◽  
Development Tool ◽  
Large Databases

It’s necessary for surveying and mapping departments to manage aerial surveying digital data. How to manage increasing data automatically has become an urgent problem to be settled.The framework designing of the aerial digital data management information system is deeply dissertated and discussed in this paper. Then the system based on two-tier C/S structured model, using the Borland's Delphi development tool, Microsoft’s SQL Server 2000 ultra-large databases and SuperMap Objects graphical components is established, using parts of present data collecting from the aerial photographic surveying department.Compared with traditional systems, this aerial digital data management system has a good nature.It realize the automation management and operation easily.

scholarly journals Comparison of NoSQL Database Performance with SQL Server Database on Online Airplane Ticket Booking

2020 ◽  
Vol 4 (2) ◽  
pp. 64
Author(s):  
Nadea Cipta Laksmita ◽  
Erwin Apriliyanto ◽  
I Wayan Pandu ◽  
Kusrini Rini
Keyword(s):  
Sql Server ◽  
Web Browser ◽  
Travel Agents ◽  
Testing Method ◽  
Database Server ◽  
Database Table ◽  
Nosql Database ◽  
Sql Database ◽  
Sql Server Database ◽  
To Come

<em>Flight ticket booking services have become more advanced, where bookings can be made through the android / iOS application and through a web browser, ticket reservations, no longer have to come to travel agents or come to the airport to book plane tickets. In this study using an online ticket booking database where one database uses the NoSQL database and another database uses SQL Server. The purpose of this research is to test the performance of NoSQL speed with SQL Server with the Insert, Delete and Select commands. The testing method uses 100 records, 500 records, 1000 records, and 5000 records, with each record being tested four times and then taken on average. The results of this study are that the NoSQL database Insert command has a speed 4 times faster than the SQL Server database for under 500 records, whereas above 500 NoSQL database records 5 times slower, the Delete NoSQL database command has a speed 3 times faster than the SQL database Server, and the command Select 1 NoSQL database table 55 times faster than SQL Server databases, while 2 NoSQL database tables are 18 times slower than SQL Server databases, while 3 NoSQL database tables are 10 times slower than SQL Server databases, whereas 4 database tables NoSQL is 16 times slower than SQL Server databases.</em>

Enhancing Call-Level Interfaces with Thread-Safe Local Memory Structures

2017 ◽  
Vol 27 (09n10) ◽  
pp. 1549-1565
Author(s):  
Óscar Mortágua Pereira ◽  
Rui L. Aguiar
Keyword(s):  
High Performance ◽  
Sql Server ◽  
Proof Of Concept ◽  
Database Applications ◽  
Local Memory ◽  
Performance Requirements ◽  
Nosql Database ◽  
Architectural Tactics ◽  
Database Connectivity ◽  
Computational Resources

Database applications are being increasingly under pressure to respond effectively to ever more demanding performance requirements. Software architects can resort to several well-known architectural tactics to minimize the possibility of coming across with any performance bottleneck. The usage of call-level interfaces (CLIs) is a strategy aimed at reducing the overhead of business components. CLIs are low-level APIs that provide a high-performance environment to execute standard SQL statements on relational and also on some NoSQL database (DB) servers. In spite of these valuable features, CLIs are not thread-safe when distinct threads need to share datasets retrieved through Select statements from databases. Thus, even in situations where two or more threads could share a dataset, there is no other possibility than providing each thread with its own dataset, this way leading to an increased need of computational resources. To overcome this drawback, in this paper we propose a new natively thread-safe architecture. The implementation herein presented is based on a thread-safe updatable local memory structure (LMS) where the data retrieved from databases is kept. A proof of concept based on Java Database Connectivity type 4 (JDBC) for SQL Server 2008 is presented and also a performance assessment.

scholarly journals A literature review on NoSQL database for big data processing

2018 ◽  
Vol 7 (2) ◽  
pp. 902 ◽  
Author(s):  
Md. Razu Ahmed ◽  
Mst. Arifa Khatun ◽  
Md. Asraf Ali ◽  
Kenneth Sundaraj
Keyword(s):  
Big Data ◽  
Literature Review ◽  
Data Processing ◽  
Value Chain ◽  
Specific Area ◽  
Performance Comparison ◽  
Time Data ◽  
Big Data Processing ◽  
Nosql Databases ◽  
Nosql Database

Objective: Aim of the present study was to literature review on the NoSQL Database for Big Data processing including the structural issues and the real-time data mining techniques to extract the estimated valuable information.Methods: We searched the Springer Link and IEEE Xplore online databases for articles published in English language during the last seven years (between January 2011 and December 2017). We specifically searched for two keywords (“NoSQL” and “Big Data”) to find the articles. The inclusion criteria were articles on the use of performance comparison on valuable information processing in the field of Big Data through NoSQL databases.Results: In the 18 selected articles, this review identified 8 articles which provided various suitable recommendations on NoSQL databases for specific area focus on the value chain of Big Data, 5 articles described the performance comparison of different NoSQL databases, 2 articles presented the background of basics characteristics data model for NoSQL, 1 article denoted the storage in respect of cloud computing and 2 articles focused the transactions of NoSQL.Conclusion: In this literature, we presented the NoSQL databases for Big Data processing including its transactional and structural issues. Additionally, we highlight research directions and challenges in relation to Big Data processing. Therefore, we believe that the information contained in this review will incredible support and guide the progress of the Big Data processing.  

scholarly journals Performance comparison of relational databases SQL Server, MySQL and PostgreSQL using a web application and the Laravel framework

2020 ◽  
Vol 17 ◽  
pp. 358-364
Author(s):  
Rafał Wodyk ◽  
Maria Skublewska-Paszkowska
Keyword(s):  
Web Application ◽  
Relational Databases ◽  
Performance Comparison ◽  
Sql Server ◽  
Technical Parameters

Many database implementations are supported by application frameworks that can affect their performance. The paper presents a comparison of the performance of SQL Server, MySQL and PostgreSQL relational databases based on an application written in PHP using the Laravel framework. The time of performance for various types of queries, both simple and using column and table concatenation was evaluated. The obtained results for the same database structures differed depending on the operations performed on the databases. Looking at the entirety of the research conducted, it can be concluded that in the case of databases in which the number of records is not too large (up to 1000 records) and the technical parameters of the device on which the database is running are of low or medium class, MySQL performs very well.

Converging Evidence for Developmental Trauma Disorder: Empirical Support From Large Databases

2008 ◽  
Author(s):  
Bradley C. Stolbach ◽  
Frank Putnam ◽  
Melissa Perry ◽  
Karen Putnam ◽  
William Harris ◽  
...  
Keyword(s):  
Empirical Support ◽  
Developmental Trauma ◽  
Developmental Trauma Disorder ◽  
Large Databases
Sign in / Sign up

Export Citation Format

Share Document