scholarly journals Performance analysis of selected database systems: MySQL, MS SQL, PostgerSQL in the context of web applications

2020 ◽  
Vol 14 ◽  
pp. 94-100
Author(s):  
Katarzyna Lachewicz
Keyword(s):  
Performance Analysis ◽  
Web Applications ◽  
New Technologies ◽  
Database Systems ◽  
Main Task ◽  
Internet Applications ◽  
Database Queries ◽  
Spring Framework ◽  
Database Performance ◽  
Performance Research

The main purpose of this article is to check which database: MySQL, MS SQL, PostgerSQL is the most efficient for Internet applications. This work contains information about the databases used, but the most important part of this article is database performance research. They are based on an application whose main task was database queries. The program was created based on new technologies, such as the Spring framework, the Hibernate library and JDBC Interface.

scholarly journals WebAssembly potentials: A performance analysis on desktop environment and opportunities for discussions to its application on CPS environment

2020 ◽  
Author(s):  
João Lourenço Souza Junior ◽  
Davi De Oliveira ◽  
Victor Praxedes ◽  
Dennys Simiao
Keyword(s):  
Performance Analysis ◽  
Web Applications ◽  
New Technologies ◽  
Machine Language ◽  
Semantic Heterogeneity ◽  
Embedded Devices ◽  
Web Browser ◽  
Vast Number ◽  
New Type ◽  
A Performance

The Web started as a simple document-sharing network and today has evolved to become a consolidated and ubiquitous platform for creation and application distribution. To explore its demands, web browser vendors have been working on new technologies like WebAssembly, a new type of machine language for a conceptual machine instead of a real physical machine, supported by the modern web browsers, providing new features and greater performance for web applications. At the other end, embedded devices have also evolved along with applications. However, there are still semantic heterogeneity, maintainability, and development issues inherent to the vast number of devices and services that operates in the numerous domains of Cyber-Physical Systems (CPS). The overall objective of this work is to study the WebAssembly technology through a performance analysis in a desktop environment, presenting empirical comparisons between the execution of a program compiled in native machine code and the same program compiled in WebAssembly, to verify its flexibility to compile code written in different languages for web applications and maintain similar performance to their native applications counterpart. We also point out the opportunities and challenges to potentially apply WebAssembly as a semantic abstraction layer for embedded devices in CPS development.

scholarly journals Re-engineering Legacy Web Applications into Rich Internet Applications

2010 ◽  
pp. 189-203 ◽  
Author(s):  
Roberto Rodríguez-Echeverría ◽  
José María Conejero ◽  
Marino Linaje ◽  
Juan Carlos Preciado ◽  
Fernando Sánchez-Figueroa
Keyword(s):  
Web Applications ◽  
Internet Applications ◽  
Rich Internet Applications

scholarly journals PHP modernization approach generating KDM models from PHP legacy code

2020 ◽  
Vol 9 (1) ◽  
pp. 247-255
Author(s):  
Amine Moutaouakkil ◽  
Samir Mbarki
Keyword(s):  
Web 2.0 ◽  
Web Applications ◽  
New Technologies ◽  
Extraction Process ◽  
Entry Point ◽  
Legacy System ◽  
Web Technologies ◽  
Software Artifacts ◽  
Target Platform ◽  
Web Systems

With the rise of new web technologies such as web 2.0, Jquery, Bootstrap. Modernizing legacy  web systems to  benefit from the advantages of the new technologies is more and more relevant. The migration of a system from an environment to another is a time and effort consuming process, it involves a complete rewrite of the application adapted to the target platform. To realize this migration in an automated and standardized way, many approaches have tried to define standardized engineering processes. Architecture Driven Modernization (ADM) defines an approach to standardize and automate the reengineering process.  We defined an ADM approach to represent PHP web applications in the highest level of abstraction models. To do this, we have used software artifacts as a entry point . This paper describes the extraction process, which permits discovering and understanding of the legacy system. And generate models to represent the system in an abstract way.

scholarly journals Model-Driven Approach to develop Rich Web Applications

2018 ◽  
Vol 21 (2) ◽  
Author(s):  
Guido Nuñez ◽  
Daniel Bonhaure ◽  
Magalí González ◽  
Nathalie Aquino ◽  
Luca Cernuzzi
Keyword(s):  
Code Generation ◽  
Web Application ◽  
Web Applications ◽  
Application Development ◽  
Internet Applications ◽  
Architecture Model ◽  
Model Driven ◽  
Rich Internet Applications ◽  
Preliminary Validation ◽  
Model Driven Approach

Many Web applications have among their features the possibility of distributing their data and their business logic between the client and the server, also allowing an asynchronous communication between them. These features, originally associated with the arrival of Rich Internet Applications (RIA), remain particularly relevant and desirable. In the area of RIA, there are few proposals that simultaneously consider these features, adopt Model-Driven Development (MDD), and use implementation technologies based on scripting. In this work, we start from MoWebA, an MDD approach to web application development, and we extend it by defining a specific architecture model with RIA functionalities, supporting the previously mentioned features. We have defined the necessary metamodels and UML profiles, as well as transformation rules that allow you to generate code based on HTML5, Javascript, jQuery, jQuery Datatables and jQuery UI. The preliminary validation of the proposal shows positive evidences regarding the effectiveness, efficiency and satisfaction of the users with respect to the modeling and code generation processes of the proposal.

scholarly journals Performance Benchmarking of Key-Value Store NoSQL Databases

2018 ◽  
Vol 8 (6) ◽  
pp. 5333
Author(s):  
Omoruyi Osemwegie ◽  
Kennedy Okokpujie ◽  
Nsikan Nkordeh ◽  
Charles Ndujiuba ◽  
Samuel John ◽  
...  
Keyword(s):  
Data Storage ◽  
Web Applications ◽  
Query Language ◽  
Research Work ◽  
Database Systems ◽  
Nosql Databases ◽  
Performance Benchmarking ◽  
Nosql Database ◽  
Structured Query Language ◽  
Web Developers

<p>Increasing requirements for scalability and elasticity of data storage for web applications has made Not Structured Query Language NoSQL databases more invaluable to web developers. One of such NoSQL Database solutions is Redis. A budding alternative to Redis database is the SSDB database, which is also a key-value store but is disk-based. The aim of this research work is to benchmark both databases (Redis and SSDB) using the Yahoo Cloud Serving Benchmark (YCSB). YCSB is a platform that has been used to compare and benchmark similar NoSQL database systems. Both databases were given variable workloads to identify the throughput of all given operations. The results obtained shows that SSDB gives a better throughput for majority of operations to Redis’s performance.</p>

scholarly journals Minimization in Cooperative Response to Failing Database Queries

1997 ◽  
Vol 06 (02) ◽  
pp. 95-149 ◽  
Author(s):  
Parke Godfrey
Keyword(s):  
Optimal Algorithm ◽  
Simple Algorithm ◽  
Search Space ◽  
Database Systems ◽  
Identification Problems ◽  
Database Queries ◽  
The Past ◽  
Cause Of Failure ◽  
Algorithmic Approaches ◽  
Answer Set

When a query fails, it is more cooperative to identify the cause of failure, rather than just to report the empty answer set. When there is not a cause per se for the query's failure, it is then worthwhile to report the part of the query which failed. To identify a Minimal Failing Subquery (MFS) of the query is the best way to do this. (This MFS is not unique; there may be many of them.) Likewise, to identify a Maximal Succeeding Subquery (XSS) can help a user to recast a new query that leads to a non-empty answer set. Database systems do not provide the functionality of these types of cooperative responses. This may be, in part, because algorithmic approaches to finding the MFSs and the XSSs to a failing query are not obvious. The search space of subqueries is large. Despite work on MFSs in the past, the algorithmic complexity of these identification problems had remained uncharted. This paper shows the complexity profile of MFS and XSS identification. It is shown that there exists a simple algorithm for finding an MFS or an XSS by asking N subsequent queries, in which N is the length of the query. To find more MFSs (or XSSs) can be hard. It is shown that to find N MFSs (or XSSs) is NP-hard. To find k MFSs (or XSSs), for a fixed k, remains polynomial. An optimal algorithm for enumerating MFSs and XSSs, ISHMAEL, is developed and presented. The algorithm has ideal performance in enumeration, finding the first answers quickly, and only decaying toward intractability in a predictable manner as further answers are found. The complexity results and the algorithmic approaches given in this paper should allow for the construction of cooperative facilities which identify MFSs and XSSs for database systems. These results are relevant to a number of problems outside of databases too, and may find further application.

Sign in / Sign up

Export Citation Format

Share Document