


We also investigate the existing matrix based algorithms and compare their pros and cons to our proposed algorithms. Two of the suggested algorithms follow the data dependency paradigm whereas the third one follows the transaction dependency paradigm. In contrary to traditional algorithms, we store the dependencies in data structures to be used to discover the damaged part of the database. The algorithms do not require scanning the log file during the damage assessment stage.

In this thesis, we present three high performance damage assessment and recovery algorithms to restore the database to its consistent state. In addition, they require scanning the entire log file from the point of attack to the end, which is inefficient. Traditional recovery methods do not take into consideration the existing dependencies between different data items and transactions. Consequently, efficient damage assessment and recovery techniques are demanded. However, the history of system break-ins guarantees that there is always a chance for a successful attack on the data. Hence, securing databases is a critical concern. Databases are exposed to interception from intruders who can cause real damage to confidential data. With the evolution of high speed internet technologies, massive data is exchanged everyday between various information systems without any centralized control.

Then, in the next section, future trends are presented. In the fifth section, a multilevel secure distributed transaction-processing system is presented. In the fourth section, security-related issues are discussed. Then, next, an overview of a distributed transaction-processing system is presented. The next section provides some background. In this work, we address the issues of achieving a multilevel secure DTPSs system and discuss the security constraints and the replication of data items. We address the issues of achieving a multilevel secure DTPS, and discuss the security constraints and data replication. The security policies and integrity constraints adopted at each site may result in global security having inconsistent states. Properties of a DTPS, such as data replication, may have a substantial effect on the security of the system.
A transaction processing system is software#
Each of these transaction processing systems is controlled by a software layer and can be accessed both remotely and locally. A distributed transaction-processing system (DTPS) is a collection of a finite number of centralized transaction-processing systems connected by a computer network. In this article, we address the issues of multilevel security in distributed transaction-processing systems. However, the approaches to the issues associated with using TPS in multilevel secure environments are still in the research stage. In the following it will be assumed that the organizations already provide of Transaction Processing Facilities (TPF), that Main Memory Database Systems (MMDS) are not practical, that most TP systems are already distributed and finally that the organizations have the fastest available computers & networks already installed.IntroductIon Transaction-processing systems (TPS) are becoming increasingly more available as commercial products. To identify a certain performance of a TP system the Input/Output (I/O) of a system is a adequate measure. Ĭonsidering the highly increased volume of transactions processed by organizations due to the credit card revolution and the Internet and their need to process the transactions in a timely fashion there arise several problems and performance constraints to the transaction processing and its systems, which need to be addressed. Examples of TP applications are payroll, inventory, order processing, reservations, account processing in banks, and stock trading. Usually there exit several different systems in one organization. Ī TP system is a form of data base management system that processes business transactions. Therefore business transactions are multiple basic operations involving exchanges (cash, credit, information) that have financial implications, such as customer placing an order or someone paying a parking ticket and they establish a connection between an organization and its database. This report will discuss problems and solutions to transaction processing (TP) systems.Ī brief introduction to the issue by defining and describing a transaction and a TP system is to give here before beginning with the core discussion.Ī transaction in general implants changes made in the real world in a physical database.
