• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.735-738
• /
• 2000

The most important issue in database security is correct concurrency control under the restrictive security policy. The goal of secure transaction management is to keep security and provide many concurrent users with the high availability of database. In this paper, we consider the security environment of multidatabase system with replicated data. The read-from relationship in the existed serializability is improper in security environment. So, we define new read-from relationship and propose new secure 1-copy quasi-seriailzability by utilizing this relationship and display some examples. This security environment requires both the existed local autonomy and the security autonomy as newly defined restriction. To solve covert channel problem is the most difficult issue in developing secure scheduling scheme. The proposed secure 1-copy quasi-serializability is very proper for global transactions in that this serializability not violates security autonomy and prevents covert channel between global transactions.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.648-651
• /
• 2002

In data broadcast environments, data is disseminated from a small number of sewers to a much larger number of clients. The advancing technology of hardware and increasing needs of users' have extended a broadcast environments. A mobile environment use the data broadcasting. A user carrying a portable computer can submit the operations of a transaction. Some limitations such as the poor-resource, user mobility, and low bandwidth are difficult to apply traditional transaction management to the mobile environments. So, the new mechanisms are needed and one of the them is the correctness criteria of transactions. Serializability is the most used criteria, but serializability is not appropriate to the broadcast environment because unnecessary abort and additional message exchanges are occurred. Hence, in this paper, we will address the need of the new correctness criteria weaker than serializability and describe the adoption of the update consistency.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.6
• /
• pp.1365-1374
• /
• 1996

To alleviate the blocking inherent in 2-phase commit protocol(2PC) that is widely used to ensure the atomicity of global transactions in distributed environments, an optimistic 2PC can be used. Under the optimistic 2PC, compensation transactions are introduced to ensure the atomicity of transactions, which may result in the violation of global serializability due to the properties of compensation, transactions. In this paper, we propose several valid management protocols for global transactions to ensure the global serializability through the analysis of transaction of state transitions. To determine the execution of one global transaction, the proposed protocols check the sates of other concurrent global transactions. According to the result, execution of the global transaction may be delayed to ensure the global serializability.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.5 no.4
• /
• pp.99-108
• /
• 2009

In the security environments of heterogeneous multidatabase systems, not only the existing local autonomy but also the security autonomy as a new constraint are required. From global aspects, transactions maintain consistent data value when they assure serializability. Also, secure properties must protect these transactions and data values to prevent direct or indirect information effluence. This paper proposes scheduling algorithm for global transactions to ensure multilevel secure one-copy quasi-serializability (MLS/1QSR) in security environments of multidatabase systems with replicated data and proves its correctness. The proposed algorithm does not violate security autonomy and globally guarantees MLS/1QSR without indirect information effluence in multidatabase systems.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.2
• /
• pp.1-7
• /
• 2001

The database development is in need or transaction management composed of operations about data, efficiency database management and security of information data in necessity of as well as the new thinking about data security. When users approach data, transaction concurrency is controlled by the users security authentication and security level of data. So, existing secure algorithm occurred the problems which don't satisfy serializability of high level transaction which is delayed high level transaction repeatedly by the low level transaction, because existing secure algorithm is focused on the part which removes the security channel. Therefore this proposed algorithm which prevents waste of resource from the high level transaction reexecution and delay by stopping serializability offense problem by the increase of efficiency of concurrency control.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.2
• /
• pp.172-183
• /
• 1994

In the multidatabase systems(MDBS), local autonomy and global consistency are important issues. Global consistency could be maintained by a global concurrency control algorithm and a global recovery algorithm. In this thesis, we propose a global concurrency control algorithm to ensure local autonomy and to guarantee global serializability, and a global recovery algorithm which is possible to recover the multudatabase from any failures. The proposed global concurrency control algorithm uses bottom-up approach, based on three-level transaction processing model. It can produce a local history that the execution order of subtransactions is identical to their serialization order by using dummy-operations in the server when an indirect conflict is caused between subtransactions due to local transactions. At the global module, it can efficiently validate global serializability of global transactions by checking global serializability only for the global transactions which conflict with each other.

• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.473-482
• /
• 2001

Integrated heterogeneous database systems provide the unified interface for users and applications today in order to access the underlying diverse data sources located in different sites. The multiple heterogeneous data sources have the different and specialized data structures and transaction processing capabilities. Because of local autonomy, the local system does not have the capability of cooperation to control the global transaction. Hence designing the global transaction manager with supporting the global serializability is difficult task. To resolve the well-known indirect conflict, we define the global transaction model by using the characteristics of global integrity constraints. And then we propose the site-locking operation and its protocol to manage the global transaction. The correctness and analysis of our site-locking protocol is proved and performance gain over the related other methods is also estimated in this paper.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10b
• /
• pp.69-71
• /
• 1998

다중 데이터베이스 시스템에서 전역 트랜잭션을 순차적으로 실행하여도 전역 직렬가능성 보장을 위한 동시성 제어 방법의 개발에서 가장 중요한 고려 요소가 되는 간접충돌은 발생한다. 본 논문에서는, 간접충돌과 전역 직렬가능성의 관계를 분석하여 순차실행은 전역 직렬가능성에 영향을 주지 않음을 보였다.

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.95-107
• /
• 2003

The broadcast environment has asymmetric communication aspect that is typically much greater communication bandwidth available from server to clients than in the opposite direction. In addition, most of mobile computing systems allow mostly read-only transactions from mobile clients for retrieving different types of information such as stock data, traffic information and mews updates. Since previous concurrency control protocols, however, do not consider such a particular characteristics, the performance degradation occurs when previous schemes are applied to the broadcast environment. In this paper, we propose the efficient concurrency control for query transaction in broadcast environment. The following requirements are satisfied by adapting weak consistency that is the appropriate correctness criterion of read-only transactions: (1) the mutual consistency of data maintained by the server and read by clients (2) the currency of data read by clients. We also use the serialization graph scheme to check the weak consistency efficiently. As a result, we improved a performance by reducing unnecessary aborts and restarts of read-only transactions caused when global serializability was adopted.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11
• /
• pp.2889-2899
• /
• 1999

To maintain the traditional notion of global serializability in multidatabase systems has been recognized as one of difficult problems due to the autonomy of participating local database systems. In this paper, we propose a global concurrency control algorithm based on the relaxed concurrency control criterion in distributed MDBs, which can be applied to applications in which the database integration has no effect on the integrity constraints. In the proposed algorithm, the process to determine whether a global transaction can be executed or not consists of intra-validation phase and inter-validation phase.