• Journal of Internet Computing and Services
• /
• v.7 no.6
• /
• pp.79-86
• /
• 2006

Many of concurrency control for client-sewer database systems have been proposed and studied in the literature. However, commonly known schemes do not manage to the case of dramatic changes in data contention because the data contention of database systems is changed for each cases. In this paper, we propose o hybrid concurrency control. The proposed scheme uses a optimistic scheme for the first-run transactions and a pessimistic scheme for the second-run transactions. By pre-claiming locks in the second phase, deadlocks which ore possible in pessimistic based concurrency control are prevented in our approach. In addition, the scheme ensures at most one re-execution even if the validation in the optimistic phase fails. By a detailed simulation, this paper examines the behaviors of the Distributed Optimistic Concurrency Control and the proposed scheme. The simulation study shows our scheme outperforms Distributed Optimistic Concurrency Control in our experimental result.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1899-1911
• /
• 2018

In this work, we propose a concurrency control scheme in object-oriented database (OODB). Since an OODB provides complex modeling power than the conventional relational databases, a concurrency control technique in OODB is also rather complicated and has influence on the overall performance. Thus, it is very important to develop a concurrency control technique with less overhead. The proposed scheme deals with class hierarchy that is a key concept in OODBs. The proposed scheme is developed on implicit locking scheme. Also, the proposed scheme is designed using data access frequency in order to reduce locking overhead than implicit locking. It means that, if access frequency information is not available, the proposed scheme works just like the existing implicit locking, In our work, the correctness of the proposed scheme is proved. The performance is analyzed depending on access types. Also, it is proved that our scheme performs works much better than the implicit locking does.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.5 s.37
• /
• pp.57-64
• /
• 2005

While the secure concurrency control schemes in multilevel secure database management systems synchronize transactions cleared at different security level they must consider the problem covert channel. although previous works achieve the confidentiality successfully, they overlook the integrity or the availability. For being evaluated as highly secure database systems , the multilevel secure database management systems must achieve the confidentiality, integrity, and the availability that are the well-known major security aspects. By use of verified transactions ordering relationship, in this Paper, we Propose a new secure concurrency control scheme that is capable of increasing the degree of fairness among transactions cleared at different security levels.

• Journal of Korea Multimedia Society
• /
• v.9 no.6
• /
• pp.693-699
• /
• 2006

Object-oriented databases (OODBs) have been adopted for managing non-standard applications such as computer-aided design (CAD), office document management and many multimedia applications. One of the major characteristics of OODBs is class hierarchy where a subclass is allowed to inherit the definitions defined on its superclasses. In this paper, I present the evaluation metrics for class hierarchy quality in OODBs. These metrics are developed to determine if a concurrency control scheme can achieve good performance or not on a given class hierarchy. I first discuss the existing concurrency control schemes for OODBs. Then I provide evaluation metrics based on structural information and access frequency information in class hierarchies. In order to discuss significance of the proposed performance metrics, an analytical model is developed. Analysis results show that the performance metrics are important factor in concurrency control performance. I consider both single inheritance and multiple inheritance. The proposed metrics can be used to provide guidelines on how to design class hierarchy of an OODB for maximizing the performance of concurrency control technique.

• Journal of Korea Multimedia Society
• /
• v.7 no.5
• /
• pp.633-639
• /
• 2004

The performance of optimistic concurrency control schemes which are generally used for Mobile computing is very sensitive to the transaction abort rate. Even if the abort probability can be reduced by back-shifting the timestamp from the time of requesting a commit, some transactions continuously perform unnecessary operations after the transactions accessed write-write conflicting data. In this paper, we propose an optimistic protocol that can abort the transactions during the execution phase by using the write notification approach. The proposed protocol enhances the performance of the optimistic concurrency control by reducing the unnecessary operations. In addition, we present a simulation study that compares our schemes with the timestamp based certification scheme. This study shows that our scheme outperforms the timestamp based certification scheme.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.5 s.37
• /
• pp.41-48
• /
• 2005

In this thesis, we propose a concurrency control scheme which schedules global transactions in multidatabase systems Unlike other scheme which commit global transactions as soon as they have finished their execution, this scheme has attempted to delay them if their exist another global transactions that should be proceeded. Owing to the deferred commitment, the number of global restarts could be greatly reduced. This scheme's performance gain increased through simulations in case more than one LDBS employ timestamp ordering(TO) as a local concurrency control scheme.

• Journal of Information Processing Systems
• /
• v.14 no.2
• /
• pp.499-509
• /
• 2018

Recently, hybrid transactional memory (HyTM) has gained much interest from researchers because it combines the advantages of hardware transactional memory (HTM) and software transactional memory (STM). To provide the concurrency control of transactions, the existing HyTM-based studies use a bloom filter. However, they fail to overcome the typical false positive errors of a bloom filter. Though the existing studies use a global lock, the efficiency of global lock-based memory allocation is significantly low in multi-core environment. In this paper, we propose an efficient hybrid transactional memory scheme using near-optimal retry computation and sophisticated memory management in order to efficiently process transactions in multi-core environment. First, we propose a near-optimal retry computation algorithm that provides an efficient HTM configuration using machine learning algorithms, according to the characteristic of a given workload. Second, we provide an efficient concurrency control for transactions in different environments by using a sophisticated bloom filter. Third, we propose a memory management scheme being optimized for the CPU cache line, in order to provide a fast transaction processing. Finally, it is shown from our performance evaluation that our HyTM scheme achieves up to 2.5 times better performance by using the Stanford transactional applications for multi-processing (STAMP) benchmarks than the state-of-the-art algorithms.

• Journal of KIISE:Databases
• /
• v.32 no.1
• /
• pp.100-110
• /
• 2005

The update transactions to be executed in spatial databases usually have been known as interactive and long duration works. To improve the parallelism of concurrent updates, it needs multiple transactions concurrently update a large spatial object which has a spatial extensions larger than workspace of a client. However, under the existing locking protocols, it is not possible to concurrently update a large spatial object because of conflict of a write lock This paper proposes a partial locking scheme of enabling a transaction to set locks on parts of a big object. The partial locking scheme which is an exclusive locking scheme set by user, acquires locks for a part of the big object to restrict the unit of concurrency control to a partial object of a big object. The scheme gives benefits of improving the concurrency of un updating job for a large object because it makes the lock control granularity finer.

• KSCI Review
• /
• v.1 no.2
• /
• pp.95-107
• /
• 1995

The concurrency control can be critical to the performance of transaction processing systems. Conventional locking takes the blocking phenomenon, where waiting transactions continue to hold locks and block other transactions from progressing. The proposed scheme reduces the blocking probability by deferring the blocking behavior of transactions to the later stages of their execution. The transaction execution can be divided into a nonblocking phase where transactions wait for locks but do not block other transactions and a blocking phase as in conventional locking. However data accessed during the nonblocking phase can lead to transaction abort. By properly balancing the blocking and abort effects, the proposed scheme can lead to better performance than either the conventional locking or the optimistic concurrency control(OCC) scheme at all data and resource contention levels.

• Journal of Internet Computing and Services
• /
• v.19 no.5
• /
• pp.107-113
• /
• 2018

Object-oriented databases (OODBs) canbe used for many non-traditional database application areas such as computer-aided design, etc. Usually those application areas require advanced modeling power for expressing complicated relationships among data sets. OODBs have more distinguished features than the traditional relational database systems. One of the distinguished characteristics of OODBs is class hierarchy (also called inheritance hierarchy). A class hierarchy in an OODB means that a class can hand down the definitions of the class to the subclass of the class. In other words, a class is allowed to inherit the definitions of the class from the superclass. In this paper, we present performance evaluation metrics for class hierarchy in OODBs from a concurrency control perspective. The proposed performance metrics are developed to determine which concurrency control scheme in OODBs can be used for a given class hierarchy. In this study, in order to develop performance metrics, we use class hierarchy structure (both of single inheritance and multiple inheritance), and data access frequency for each class. The proposed performance metrics will be also used to compare performance evaluation for various concurrency control techniques.