• Journal of KIISE:Databases
• /
• v.27 no.1
• /
• pp.42-52
• /
• 2000

In many real time applications that the system maintains sensitive information to be shared by multiple users with different security levels, security is another important requirement. A secure real time database system must satisfy not only logical data consistency but also timing constrains and security requirements associated with transactions. Even though an optimistic concurrency control method outperforms locking based method in firm real time database systems, where late transactions are immediately discarded, most existing secure real time concurrency control methods are based on locking. In this paper, we propose a new optimistic concurrency control protocol for secure real time database systems, and compare the performance characteristics of our protocol with locking based method while varying workloads. The result shoes that our proposed O.C.C protocol has good performance in case of many data conflict.

• The KIPS Transactions:PartD
• /
• v.8D no.2
• /
• pp.132-144
• /
• 2001

The broadcast environment is asymmetric communication aspect that is typically much greater communication capacity available from server to clients than in the opposite direction. In addition, most of mobile computing systems only allow the generation of read-only transactions from mobile clients for retrieving different types of information such as stock data, traffic information and news updates. Since previous concurrency control protocols, however, do not consider such a particular characteristics, the performance degradation occurs when those schemes are applied to the broadcast environment having quite a high data contention. In this paper, we propose OCC/2VTS (Optimistic Concurrency Control based on 2-Version and TimeStamp) that is most appropriate for broadcast environment. OCC/2VTS lets each client process and commit query transactions for itself by using two version data in cache. If the values of appropriate data items are not changed twice by invalidation report after a query transaction starts, the query transaction is committed safely independent of commitment of update transactions. OCC/2VTS decreases the number of informing server for the purpose of commitment. Due to broadcasting the validation reports including updated recent values, it reduces the opportunity of requesting a recent data values of server as well. As a result, OCC/2VTS makes full use of the asymmetric bandwidth. It also improves transaction throughput by increasing the query transaction commit ratio as much as possible.

• The KIPS Transactions:PartD
• /
• v.9D no.2
• /
• pp.185-194
• /
• 2002

Most of mobile computing systems allow mostly read-only transactions from mobile clients for retrieving various types of Information such as stock data, traffic information and news updates. Since previous concurrence 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 OCC/UTF(Optimistic Concurrence Control with Update Transaction First) that is most appropriate for broadcast environment. OCC/UTF lets a query transaction, that has already read the data item which was invalidated by update transaction, read again the same data item without the abort of the query transaction due to non-serializability. Therefore, serializable order is maintained and the query transaction is committed safely regardless of commitment of update transactions. In OCC/UTF, Clients need not require server to commit their query transactions. Because of broadcasting the validation reports including values updated recently to clients, it reduces the overhead of requesting recent values from the server and the server need not also re-broadcast the newest values. As a result, OCC/UTF makes full use of the asymmetric bandwidth. It can also improve transaction throughput by increasing the commit ratio of query transactions as much as possible.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.895-904
• /
• 1999

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2751-2762
• /
• 1998

In this paper, a new priority assignment ploicy and concurrency control for improvement of transaction predictability and performance are proposed. We present a new priority assignment algorithm called classified priority assignment(CPA), which solves the defects of Earliest Deadline First(EDF) by using class and bucket, and deals with real-time transaction and time-sharing transaction effectively. Also, we present a new concurrency control policy called conditional optimistic concurrency control using lock. It uses optimistic concurrency control for improvement of predictability, and solves transaction conflict by considering priority and execution time of transaction to waste less system resource.

• Korean Journal of Health Education and Promotion
• /
• v.20 no.3
• /
• pp.145-170
• /
• 2003

The purpose of this study was to clarity the concept of health insensitivity using Hybrid model, which consists of three phases： theoretical, empirical, and analytic. In the theoretical phase, the definitions of health insensitivity were searched in korean dictionary and examples used in the websites because the concept of health insensitivity has never been studied before. Two dimensions of health insensitivity emerged out from this investigation were cognitive and behavioral. And then a working definition of health insensitivity was established. The sub-concepts and related factors of health insensitivity were identified through the extensive reviews of the literature focusing on two dimensions of cognitive and behavioral. In the empirical phase, in order to obtain description of health insensitivity, face-to-face in-depth interviews were conducted with nine persons who are not related to professional health care. Grounded theory approach was applied to analyze these qualitative data. In the final analytic phase, theoretical results and empirical results were analyzed in the integrated way and a theoretical framework of health insensitivity was established. A refined definition of health insensitivity was that decreased health risk perception in cognitive dimension and conduction of the unhealthy behaviors in behavioral dimension. Sub-concepts of decreased health risk perception were optimistic bias and decreased general fear. Sub-concepts of unhealthy behavior were doing health threatening behavior and not doing desirable health behavior. The contact of health information was a causal condition of health insensitivity. Optimistic disposition, health locus of control, and avoidance coping style were intervening conditions of health insensitivity. Three types of health insensitivity were identified： unconcern or ignorance type, optimistic bias type, and cognitive dissonance type. Finally, The implications of these findings for further research and nursing practice are discussed.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.458-467
• /
• 2001

Optimistic Two-Phase Locking(O2PL) performs as well as or better than the other approaches because it exploits client caching well and also has relatively lower network bandwidth requirements. However, O2PL leads to unnecessary waits, because, it can not be commit a transaction until the transaction obtains all requested locks. In addition, Optimistic Concurrency Control(OCC) tends to make needless aborts. This paper suggests an efficient optimistic cache consistency protocol that overcomes such shortcomings. Our scheme decides whether to commit or abort a transaction without wait and it adopts transaction re-ordering in order to minimize the abort rate. Our scheme needs only one version for each data item in spite of the re-ordering mechanism used. Finally, this paper presents a simulation-based analysis that shows superiority in performance of out scheme to O2PL and OCC.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.439-446
• /
• 2003

A crucial limitation in environments where data is broadcast to very large client populations is the low bandwidth available for clients to communicate with servers. Many advanced applications are developed in mobile computing environments, but conventional concurrency controls are not suitable because of the low bandwidth of wireless network. In this paper, we propose a new optimistic concurrency control protocol for mobile transactions. In this protocol, mobile read-only transactions can be completed locally at the clients without additional communication, only mobile update transactions are sent to the server for global validation. Our protocol reduces unnecessary aborts occurred in the previous study using only conflict information. In addition to, our algorithm can detect and resolve non-serializable execution using by data table maintained in a server.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.8
• /
• pp.1153-1160
• /
• 2002

So far, the main applications of mobile client are querying data. However, we need a new mechanism to update data at a mobile client as mobile systems are advanced and extended. So, we present a optimistic concurrency control to schedule mobile transactions may include update operations.'rho read-only transactions can be terminated without sending information to a server, and update transactions are terminated by validating at a server. In our method, we can reduce the additional aborts by using a timestamp ordering and serialization graph test mechanism rather than using only conflict information between concurrent transactions.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.2 s.40
• /
• pp.131-143
• /
• 2006

The rapid growth of mobile communication technology has provided the expansion of mobile internet services, particularly mobile realtime transaction takes much weight among mobile fields. Current mobile transaction service has serious problems which check its development, such as low bandwidths, hand over, expensive charge system, and low response time. but, There is an increasing demand for various mobile applications to process transactions in a mobile computing fields. In mobile computing environments. A mobile host computing system demands for new concurrency control method to use the bandwidth efficiently, to improve the bottleneck and the response time of transactions. This study suggests about an efficient concurrency control in a mobile computing environment. Concurrency control method in existing method uses two phases locking method. In this method, Many clients can't use the same segment simultaneously, and so useless waiting time increases. The characteristic of this proposed method unlike existing one, Enable the transaction approaching different data in the same segment to minimize the useless waiting time by permitting segments, and therefore improves the coexistence of system. Also, It shows the algorithm of the proposed concurrence control method.