scholarly journals Performance analysis of relational databases Oracle and MS SQL based on desktop application

2018 ◽  
Vol 8 ◽  
pp. 263-269
Author(s):  
Grzegorz Dziewit ◽  
Jakub Korczyński ◽  
Maria Skublewska-Paszkowska
Keyword(s):  
Binary Data ◽  
Relational Databases ◽  
Database Systems ◽  
Database System ◽  
Sql Server ◽  
External Application ◽  
Oracle Database ◽  
Sql Server Database ◽  
Relational Database Systems ◽  
Mean Time

Comparison of efficiency is not a trivial phenomenon because of disparities between different database systems. This paper presents a methodology of comparing relational database systems in respect of mean time of execution individual DML queries containing subqueries and conjunction of tables. The presented methodology can be additionally accommodated to studies of efficiency in a range of database system itself (study of queries executed directly in database engine). The described methodology allows to receive statement telling which database system is better in comparison to another in dependency of functionalities fulfilled by external application. In the article the analysis of mean time of execution individual DML queries was performed.Two research hypotheses have been put forward: "Microsoft SQL Server database system needs less time to execute INSERT and UPDATE queries than Oracle database" and "Oracle database system needs less time to execute DML queries with binary data than SQL Server"

Towards the Maturity of Object-Relational Database Technology: Promises and Reality

2015 ◽  
Vol 6 (4) ◽  
pp. 1-19 ◽  
Author(s):  
Negin Keivani ◽  
Abdelsalam M. Maatuk ◽  
Shadi Aljawarneh ◽  
Muhammad Akhtar Ali
Keyword(s):  
Relational Database ◽  
Relational Databases ◽  
Database Systems ◽  
Database System ◽  
Relational Database System ◽  
Key Factor ◽  
Object Relational ◽  
Database Technology ◽  
Relational Database Systems ◽  
Additional Object

Object-relational technology provides a significant increase in scalability and flexibility over the traditional relational databases. The additional object-relational features are particularly satisfying for advanced database applications that relational database systems have experienced difficulties. The key factor to the success of object-relational database systems is their performance. This paper aims to review the promises of Object-Relational database systems, examine the reality, and how their promises may be fulfilled through unification with the relational technology. To investigate the performance implications of using object-relational relative to relational technology, the query-oriented BUCKY benchmark has been previously applied to an early object-relational database system, i.e., Illustra 97. This paper presents the results obtained from implementing and running the BUCKY benchmark on Oracle 10g. The results acquired from the work described in this paper are compared with the results obtained in BUCKY benchmark. This study throws light on the functionality of object-relational databases, where object-relational technology has made improvements but some limitations are identified as well. In general, the performance of relational supersedes that of object-relational database system.

Set Valued Attributes

2005 ◽  
pp. 632-637 ◽  
Author(s):  
Karthikeyan Ramasamy ◽  
Prasad M. Deshpande
Keyword(s):  
Relational Database ◽  
Data Model ◽  
Relational Databases ◽  
Database Systems ◽  
Sql Server ◽  
Relational Model ◽  
Database Model ◽  
Competitive Edge ◽  
The Past ◽  
Relational Database Systems

About three decades ago, when Codd (1970) invented the relational database model, it took the database world by storm. The enterprises that adapted it early won a large competitive edge. The past two decades have witnessed tremendous growth of relational database systems, and today the relational model is by far the dominant data model and is the foundation for leading DBMS products, including IBM DB2, Informix, Oracle, Sybase, and Microsoft SQL server. Relational databases have become a multibillion-dollar industry.

An Evaluation of Dynamic Electronic Catalog Models in Relational Database Systems

2011 ◽  
pp. 73-90 ◽  
Author(s):  
Kiryoong Kim ◽  
Dongkyu Kim ◽  
Jeuk Kim ◽  
Sang-uk Park ◽  
Ighoon Lee ◽  
...  
Keyword(s):  
Electronic Commerce ◽  
Relational Database ◽  
Relational Databases ◽  
Database Systems ◽  
Relational Schemas ◽  
Electronic Catalogs ◽  
Electronic Catalog ◽  
Software Product ◽  
New Models ◽  
Relational Database Systems

Electronic catalogs are electronic representations about products and services in the electronic commerce environment and require diverse and flexible schemas. Although relational database systems seem to be an obvious choice for their storage, traditional designs of relational schemas do not support electronic catalogs in the most effective ways. Therefore, new models for managing diverse and flexible schemas in relational databases are required for such systems. Proposed in this paper are several models for electronic catalogs using relational tables, and an experimental evaluation of their efficiency. The results of this study can be put to practical use and are, in fact, being applied in the design of a commercial software product.

The Research of Workflow Engine States

2013 ◽  
Vol 347-350 ◽  
pp. 2236-2240
Author(s):  
Yan Rong Shi ◽  
Tao Hou
Keyword(s):  
Information System ◽  
Full Advantage ◽  
Relational Database ◽  
Database Systems ◽  
Database System ◽  
Workflow Engine ◽  
Relational Database System ◽  
Logical Design ◽  
Relational Database Systems ◽  
The Cost

Based on the analysis of the workflow patterns, this paper designs the active state of the workflow, and puts forward the idea of the logical design of the engine driven. It can conveniently define the information model of the workflow based on relational database systems, it can effectively reduce the difficulty on the technical development of the workflow engine and take full advantage of existing relational database system to realize the information system that has the nature of the workflow and reduce the cost of the implementation.

scholarly journals Analysis of the possibilities of optimizing SQL queries

2021 ◽  
Vol 19 ◽  
pp. 151-158
Author(s):  
Piotr Rymarski ◽  
Grzegorz Kozieł
Keyword(s):  
Relational Database ◽  
Web Applications ◽  
Query Language ◽  
Database Systems ◽  
Sql Server ◽  
Management Systems ◽  
Relational Database Systems ◽  
The Impact ◽  
Relational Database Management ◽  
Test Scenarios

Most of today's web applications run on relational database systems. Communication with them is possible through statements written in Structured Query Language (SQL). This paper presents the most popular relational database management systems and describes common ways to optimize SQL queries. Using the research environment based on fragment of the imdb.com database, implementing OracleDb, MySQL, Microsoft SQL Server and PostgreSQL engines, a number of test scenarios were performed. The aim was to check the performance changes of SQL queries resulting from syntax modication while maintaining the result, the impact of database organization, indexing and advanced mechanisms aimed at increasing the eciency of operations performed, delivered in the systems used. The tests were carried out using a proprietary application written in Java using the Hibernate framework.

scholarly journals Oracle 19c, SQL Server 2019, Postgresql 12 and MySQL 8 database systems comparison

2020 ◽  
Vol 17 ◽  
pp. 373-378
Author(s):  
Arkadiusz Solarz ◽  
Tomasz Szymczyk
Keyword(s):  
Comparative Analysis ◽  
Open Source ◽  
Database Management ◽  
Database Systems ◽  
Sql Server ◽  
Management Systems ◽  
Database Schema ◽  
Oracle Database ◽  
Server Systems ◽  
Test Scenarios

This article presents a comparative analysis of four popular database technologies. Commercial Oracle Database and SQL Server systems are compared with open source database management systems: PostgreSQL and MySQL. These systems have been available on the market for over a dozen years. Versions released in 2019 were selected for testing and comparasion. For the purposes of the comparative analysis, a database schema was developed and instantiated. Then, test scenarios were developed. They were prepared on the basis of the most popular operations performed with the use of database systems.

Data Security Monitoring of SQL Server Database

2013 ◽  
Vol 679 ◽  
pp. 143-146
Author(s):  
Zhang Hui ◽  
Li Qiang An ◽  
Peng Yue
Keyword(s):  
Data Security ◽  
Information Aggregation ◽  
Research Process ◽  
Database System ◽  
Sql Server ◽  
Important Data ◽  
Security Monitoring ◽  
Daily Work ◽  
Sql Server Database

Database system is information aggregation. So the security of database is very important. This paper describes the research process of tracking SQL server database data tampered. Now we can monitor the important data in daily work. And providing a guarantee for the safety, accuracy of database.

A Cost-Based Range Estimation for Mapping Top-k Selection Queries over Relational Databases

2009 ◽  
Vol 20 (4) ◽  
pp. 1-25 ◽  
Author(s):  
Anteneh Ayanso ◽  
Paulo B. Goes ◽  
Kumar Mehta
Keyword(s):  
Relational Databases ◽  
Academic Research ◽  
Synthetic Data ◽  
Database Systems ◽  
Data Sets ◽  
Estimation Model ◽  
Range Estimation ◽  
Query Engine ◽  
Relational Database Systems ◽  
Query Mapping

Finding efficient methods for supporting top-k relational queries has received significant attention in academic research. One of the approaches in the recent literature is query-mapping, in which top-k queries are mapped (translated) into equivalent range queries that relational database systems (RDBMSs) normally support. This approach combines the advantage of simplicity as well as practicality by avoiding the need for modifications to the query engine, or specialized data structures or indexing techniques to handle top-k queries separately. However, existing methods following this approach fall short of adequately modeling the problem environment and providing consistent results. In this article, the authors propose a cost-based range estimation model for the query-mapping approach. They provide a methodology for trading-off relevant query execution cost components and mapping a top-k query into a cost-optimal range query for efficient execution. Their experiments on real world and synthetic data sets show that the proposed strategy not only avoids the need to calibrate workloads on specific database contents, but also performs at least as well as prior methods.

Fuzzy Classification on Relational Databases

2011 ◽  
pp. 586-614 ◽  
Author(s):  
Andreas Meier ◽  
Günter Schindler ◽  
Nicolas Werro
Keyword(s):  
Relational Databases ◽  
Information Overload ◽  
Query Language ◽  
Large Data ◽  
Database Systems ◽  
Fuzzy Classification ◽  
Linguistic Variables ◽  
Context Model ◽  
Relational Database Systems ◽  
Data Collections

In practice, information systems are based on very large data collections mostly stored in relational databases. As a result of information overload, it has become increasingly difficult to analyze huge amounts of data and to generate appropriate management decisions. Furthermore, data are often imprecise because they do not accurately represent the world or because they are themselves imperfect. For these reasons, a context model with fuzzy classes is proposed to extend relational database systems. More precisely, fuzzy classes and linguistic variables and terms, together with appropriate membership functions, are added to the database schema. The fuzzy classification query language (fCQL) allows the user to formulate unsharp queries that are then transformed into appropriate SQL statements using the fCQL toolkit so that no migration of the raw data is needed. In addition to the context model with fuzzy classes, fCQL and its implementation are presented here, illustrated by concrete examples.

Sign in / Sign up

Export Citation Format

Share Document