Research
Security in Database Systems
The paper focuses on security issues that are associated with the database system that are often used by many firms in their operations. The rapid development and proliferation of Information technology has offered many opportunities for integrated business operations. It has enabled business enhances their efficiency and effectiveness in operations such as customer care, sales, human resources and production. However, these developments have served to bring issues of security. Many firms are falling victims of cyber crimes. These are malicious people who target their data and compromise its integrity. This is occasioned by unauthorized access, which makes data lose its integrity and lastly operations of the business are affected negatively. This paper will tackle various issues in database security such as the goals of the security measures, threats to database security and the process of database security maintenance.
Improving of Quicksort Algorithm performance by sequential thread Or parallel algorithms
Quicksort is well-know algorithm used for sorting, making O(n log n) comparisons to sort a dataset of n items. Being a divide-and-conquer algorithm, it is easily modified to use parallel computing. The aim of this paper is to evaluate the performance of parallel quicksort algorithm and compare it with theoretical performance analysis. To achieve this we implement a tool to do both sequential and parallel quicksort on randomly generated arrays of different size in several runs to provide us with enough data to draw conclusions about the efficiency of using the capability of modern multicore processors together with algorithms designed to increase the speed of sorting large arrays.
