• Journal of the Korea Society of Computer and Information
• /
• v.4 no.2
• /
• pp.70-79
• /
• 1999

In mobile database system, transactions processing schemes address in ones using a static coordinator and coordinator migration. This apply coordinator migration mechanism which perform the transaction in new database server when posed to be the transaction service handoff. That apply static coordinator mechanism which perform the transaction in database server to begin the transaction when posed to be the transaction service handoff. In this paper, a scheme-independent simulation model has been developed in order to support comparative performance studies of mobile transaction processing schemes. And this paper describes the model in detail and presents simulation results which were obtained for what it believe to be the performance evaluation of the mobile transaction processing schemes. Finally, the mobile transaction processing schemes will improve system performance by minimizing the transmission of message for processing the transactions in mobile database system.

• Journal of KIISE:Databases
• /
• v.32 no.1
• /
• pp.86-99
• /
• 2005

In this paper, we suggest a system which automatically verifies and tunes transaction processing database applications based on program analysis technology. This system automatically verifies two kinds of transaction processing errors. The first case is the un-closed transaction. In this case, data is not updated as expected or performance of overall system can decrease seriously by locking some database tables until the process terminates. The second case is the miss-use of transaction isolation(inking) level. This causes runtime exception or abnormal termination of the program depending on runtime environment. This system automatically tunes two kinds of inefficient definition of transaction processing which decrease the performance of overall system. The first case happens when opened transaction is closed too late. And the second case happens when transaction isolation level is set too high.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.4
• /
• pp.19-26
• /
• 1998

Mobile database system address information processing based on database system in mobile computing environment. In the mobile database system, when a mobile transaction host enter a other radio coverage area called a cell while processing a transaction, it have to alter the communication network address to new database server. This is called transactional service handoff. This paper propose a transaction processing scheme for providing the proper function of this transactional service handoffs in mobile database system. This scheme apply coordinator migration mechanism which perform the transaction in new database server when posed to be the transaction service handoff. Fially, the proposed scheme will improve system performance by minimizing the tansmission of message for processing the transactions in mobile database system.

• Journal of Korea Multimedia Society
• /
• v.2 no.4
• /
• pp.367-377
• /
• 1999

Nowadays, the number of database applications which need fast transaction processing are increasing. One way to improve the performance of transaction processing is to reside the whole database in main memory As semiconductor memory becomes cheaper and chip densities increase, the research to improve transaction throughput rates of transaction processing system, using main memory databases, has begun In this thesis, how to implement a high performance transaction processing system based on main memory databases, new concurrency control scheme, recovery scheme and storage structure is presented. The objective of the proposed schemes is to improve the transaction processing system performance measured by transaction throughput and response times.

• Asia pacific journal of information systems
• /
• v.6 no.1
• /
• pp.21-38
• /
• 1996

This paper investigates the performance improvement opportunities through a resiliency mechanism in the distributed primary/backup database system. Recognizing that a distributed transaction executes at several servers during its lifetime, we propose a resiliency mechanism which allows continuous transaction processing in distributed database server systems in the presence of a server failure. In order to perform continuous transaction processing despite failures, every state change of a transaction processing can be saved in the backup server. Obviously, this pessimistic synchronization may give more burdens than benefits to the system. Thus, the tracking needs not be done synchronously with the transaction progress. Instead, the state of all transaction processing in a system is saved periodically. This activity is referred to as a savepoint. Then, the question is how often the savepoint has to be done. We derive the optimal savepoint to identify the optimization parameters for the resilient transaction processing system.

• The Journal of Information Systems
• /
• v.4
• /
• pp.85-104
• /
• 1995

In a loosely-coupled distributed database server system, a server failure and/or a communication failure can be masked by a resiliency mechanism. Recognizing that a distributed transaction executes at several servers during its lifetime, we propose a resiliency mechanism which allows continuous transaction processing in distributed database server systems in the presence of a server failure. The resiliency mechanism for transaction processing is achieved by keeping redundant information using a primary/backup approach. The purpose of this paper is to analyze the performance improvement opportunities with the resiliency mechanism and to present the design of the proposed system.

• Journal of the Korea Society for Simulation
• /
• v.3 no.1
• /
• pp.125-134
• /
• 1994

In real-time database systems, transactions's commitment done before the given deadlines is more important than just getting the maximum throughput. Transactions missing the given deadlines are no longer meaningful in real-time applications. Therefore, there is a need for new transaction processing models to meet the given deadlines in real-time database applications, because moat conventional transaction models are not designed to meet deadlines. In this paper we propose a new transaction models which uses multiple versions of a data item. The model uses read-from graphs and dynamic reorder of transactions to meet deadlines. A read-from graph contains the past read semantics of read operations and support the model to decide which database operation to be taken. Then, we show simulation results comparing the proposed model with other transaction models such as two phase locking model and the optimistic concurrency control model.

• 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.

• 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.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.5 s.43
• /
• pp.175-181
• /
• 2006

AMobile-supported spatial database systems have been introduced with development of mobile computing technology, they offer an advantage that we can access the data wherever we are. However, the studies on database system in traditional distributed environments must be reconsidered again, because of characteristics of mobile database system such as mobility and instability of wireless network. A new transaction model should be required for considering the characteristics, since especially a mobile computing environment is location-dependent, compared with the location transparency in a distributed computing environment. In other aspect, normally mobile host may be moving not in all space, but in some limited path. That is, a host is moving along the roads or the geographical features adjacent to the roads. The transaction processing should be considered not on the spatial coordinate but on the geographical features. In this paper, the feature based transaction processing model is proposed to process location-dependent transaction efficiently.