• 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 Journal of the Korea Contents Association
• /
• v.5 no.1
• /
• pp.157-167
• /
• 2005

In this paper, we propose a new phantom protection method for multi-dimensional index structures. The proposed method uses a hybrid approach of predicate locking and granular locking mechanisms. The proposed mechanism is independent of the types of multi-dimensional index structures, i.e., it can be applied to all types of index structures such as tree-based, file-based and hash-based index structures. Also, it achieves low development cost and high concurrency with low lock overhead. It is shown through various experiments that the proposed method outperforms existing phantom protection methods for multi-dimensional index structures.

• Journal of Information Technology Applications and Management
• /
• v.11 no.1
• /
• pp.53-67
• /
• 2004

We propose an advanced transaction scheduling protocol to improve the concurrency and to guarantee the mobility for the mobile database management systems. Mobility, portability, and wireless link In mobile computing environment can cause certain drawbacks, and thus it is more difficult to solve the concurrency control problems. However, a locking scheme should be used to guarantee the data consistency and to prevent the data conflicts. It is well known that data consistency is guaranteed by standard transaction scheduling schemes like two-phase locking (2PL). It has two of operation, lock and unlock. But 2PL does not give solution for mobile system. Altruistic Locking (AL) and classifying transactions, we adapt, can give solution for the previous problems. AL, as an advanced protocol, has attempted to reduce delay effects associated with lock release moment by the use of donation. In this paper, we extend those approaches and classify the transactions to reduce delay effects of short-lived transaction caused by long-lived transaction. In addition, we show efficient solution for the case of disconnection occurrence. Our protocol, namely, Mobile Altruistic Locking (MAL) is shown to be efficiently used in order to reduce delay effects and to guarantee database consistency in a state of the slippery connection in mobile database systems.

• The KIPS Transactions:PartD
• /
• v.9D no.4
• /
• pp.587-602
• /
• 2002

Replicated database system was emerged to resolve the problem of reduction of the availability and the reliability due to the communication failures and site errors generated at centralized database system. But if update transactions are many occurred, the update is equally executed for all replicated data. Therefore, there are many problems the same thing a message overhead generated by synchronization and the reduce of concurrency happened because of delaying the transaction. In this paper, I propose a new concurrency control algorithm for enhancing the degree of parallelism of the transaction in fully replicated database designed to improve the availability and the reliability. To improve the system performance in the replicated database should be performed the last operations in the submitted site of transactions and be independently executed update-only transactions composed of write-only transactions in all sites. I propose concurrency control method to maintain the consistency of the replicated database and reflect the result of update-only transactions in all sites. The superiority of the proposed method has been tested from the respondence and withdrawal rate. The results confirm the superiority of the proposed technique over classical correlation based method.

• Proceedings of the Korean Magnestics Society Conference
• /
• 2013.12a
• /
• pp.165-165
• /
• 2013

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.347-354
• /
• 2000

This paper presents the efficient mechanisms for concurrency control and writing authority control in collaborative writing system are represented by the tree structures which consist of the logical objects and the content objects connected to the terminal objects of trees. For concurrency control, we adopted the approach to extend the multiple-granularity-locking-scheme. This scheme allows us to lock any objects at each level of the hierarchy. We also defined the locking compatibility table by analysing the operations applicable to any objects at each level of the hierarchy. We finally suggest the extended-multiple-granularity-locking mechanism which uses the locking compatibilility table for deciding to lock an object. This scheme gives the benefit to maximize the possibility of concurrent accessing to the shared objects. In addition, we suggest a mechanism for writing authority control which prohibits the Non-Group users from modifying the shared objects based on the concept of Group/Non-Group The proposed mechanism allows us to protect copyright very reasonably.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.06a
• /
• pp.203-206
• /
• 2005

This paper presents a design experience of supervisory control system for agile and intelligent manufacturing(AIM). For effectively program job instructions, a Petri net-type graphical language is proposed and it can be applied to a various task such as concurrency and synchronization. PGL is consisted of PGL editor, PGL analyzer and PGL translator; PGL editor generates a job instruction program using graphic symbol. PGL analyzer prevents a deadlock or resource allocation of unit cell. PGL translator transfers to adequate sequential job commands of each unit cell.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04b
• /
• pp.16-18
• /
• 2001

Despite extensive research on R-trees, most of the proposed schemes have not been integrated into existing DBMS due to the lack of protocol to provide consistency in concurrent environment. R-link tree is an acceptable data structure to deal with this issue., but still not enough. In this paper, we focus on a simplified predicate locking mechanism based on R-link tree for concurrency control and phantom protection. An in-memory operation control list (OCList) used to suspend some conflicting operations is designed here. The main features of this approach are (1) it can be implemented easily and do not need any extra information. (2) Only-one-lock is held when descending R-tree even when node split happens, while lock-coupling scheme is performed when ascending. No deadlocks are possible. (3) Searches and insertions are not unnecessarily restricted. (4) Insert and Delete phantom in R-link tree are avoid through beforehand predication.

• Asia pacific journal of information systems
• /
• v.5 no.1
• /
• pp.219-235
• /
• 1995

Complexity of some problems often transcends the problem solving capability of human individuals. As such, we cannot but take a collaborative approach to those complex problems. Collaboration while using computing systems can take place through shared objects. However, current commercial DBMSs do not provide a satisfactory control for concurrent access to objects shared by collaborators. A new concurrency control scheme is proposed which will help a group of people work in a more collaborative and natural way. The idea of softlock is refined into three different kinds of softlocks and the roles of collaborators are taken into account in the proposal of the new scheme. Although these softlocks are illustrated together with read/write hardlocks in this paper, the use of softlocks can be extended to be exploited with other kinds of hardlocks, for example, of granularity locking.

• The KIPS Transactions:PartD
• /
• v.8D no.1
• /
• pp.24-31
• /
• 2001

In this paper, we present an advanced transaction scheduling protocol to improve the degree of concurrency and satisfy the security requirements for multilevel secure database. We adapted two-phase locking protocol, namely traditional syntax-oriented serializability notions, to multilevel secure database. Altruistic locking, as an advanced protocol, has attempted to reduce delay effect associated with lock release moment by use of the idea of donation. An improved form of altruism has also been deployed for extended altruistic locking OffiLl. This is in a way that scope of data to be early released is enlarged to include even data initially not intended to be donated. We also adapted XAL to multilevel secure database and we first of all investigated limitations inherent in both altruistic schemes from the perspective of alleviating starvation occasions for transactions in particular of short-lived nature for multilevel secure database. Our protocol is based on extended altruistic locking for multilevel secure database (XAL/MLS), but a new method, namely two-way donation locking for multilevel secure database (2DL!/-MLS), is additionally used in order to satisfy security requirements and concurrency. The efficiency of the proposed protocol was verified by experimental results.