• 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:Databases
• /
• v.27 no.1
• /
• pp.22-32
• /
• 2000

The Digital Library is the integrated system of Information Retrieval System(IRS) and Database Management system(DBMS). In the Digital Library environment where dynamic query and update processes are required, however, the existing transaction management methods cause the following problems. First, since the traditional consistency criteria is too restrictive, it causes increment of query processing time and cannot guarantee the reflection of recency. Second, query result could be unreliable because the consistency criteria between source data and metadata is not defined. This paper models the access to metadata based on Dublin Core as query transactions and update transactions, and gives the efficient method to manage them. Particularly, this paper describes the consistency criteria of metadata which takes it Into consideration the consistency between the result of query transaction and status of source data in the Digital Library, that is different from the consistency criteria in traditional transaction management. It also presents analysis of the view point of query transaction to reflect recency and proposes metadata management to guarantee recency within metadata consistency.

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.64-79
• /
• 2003

In client-server computing environments, update transactions of spatial data have the following characteristics. First, a transaction to update maps needs interactive work, and therefore it nay take a long time to finish. Second, a long transaction should be allowed to read the dirty data to enhance parallelism of executing concurrent transactions. when %he transaction is rolled back, it should guarantee the cascading rollback of all of the dependent transactions. Finally, two spatial objects may have a weak dependency constraint, called the spatial relationship, based on geometric topology. The existing recovery approaches cannot be directly applied to this environment, due to the high rollback cost and the overhead of cascading rollbacks. Furthermore, the previous approaches cannot guarantee the data integrity because the spatial relationship, which is a new consistency constraint of spatial data, is not considered. This paper presents new recovery schemes for update transactions of spatial data. To guarantee the data integrity, this paper defines recovery dependency as a rendition of cascading rollbacks. The partial-rollback is alto suggested to solve the problem of high rollback cost. The recovery schemes proposed in this paper can remove the unnecessary cascading rollbacks by using undo-delta, partial -redo and partial-undo. Finally, the schemes are performed to ensure the correctness.

• Journal of Distribution Science
• /
• v.19 no.7
• /
• pp.113-121
• /
• 2021

Purpose: Technology induces the virtual distribution channel to exist, especially for booking a room online. This situation, indeed, provides an alternative for the customers to book based on their budget through digital platforms. One platform offering competitive prices is virtual hotel operators, such as Airbnb, OYO, RedDoorz, and Airy Rooms. Preferably, after using their platform, the user should be satisfied and loyal. Hence, this investigation aims to prove some associations. The first is between e-satisfaction and e-loyalty. The second is between website quality and e-satisfaction. The final is between website quality and e-loyalty. Research design, data, and methodology: This study is quantitatively designed with the sample of 350 users of the virtual hotel operator applications in Bandar Lampung: Airbnb, OYO, RedDoorz, and Airy, as the samples. Therefore, by denoting this sample size, the structural equation model based on covariance is utilized to examine the three hypotheses proposed. Also, to get the responses, this study uses a survey through a questionnaire. Result: This investigation demonstrates the positive relationship between e-satisfaction and e-loyalty. Additionally, website quality positively associates with e-satisfaction and e-loyalty. Conclusion: The virtual hotel operators must have the superiority on their website-based application to update the information based on the room availability and price, ensure online transaction safety, and facilitate its utilization to maintain long-term satisfaction and loyalty virtually.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4B
• /
• pp.646-680
• /
• 2000

In this paper, we discuss the design and implementation of a concurrency control manager for a main memory DBMS(MMDBMS). Since an MMDBMS, unlike a disk-based DBMS, performs all of data update or retrieval operations by accessing main memory only, the portion of the cost for concurrency control in the total cost for a data update or retrieval is fairly high. Thus, the development of an efficient concurrency control manager highly accelerates the performance of the entire system. Our concurrency control manager employs the 2-phase locking protocol, and has the following characteristics. First, it adapts the partition, an allocation unit of main memory, as a locking granule, and thus, effectively adjusts the trade-off between the system concurrency and locking cost through the analysis of applications. Second, it enjoys low locking costs by maintaining the lock information directly in the partition itself. Third, it provides the latch as a mechanism for physical consistency of system data. Our latch supports both of the shared and exclusive modes, and maximizes the CPU utilization by combining the Bakery algorithm and Unix semaphore facility. Fourth, for solving the deadlock problem, it periodically examines whether a system is in a deadlock state using lock waiting information. In addition, we discuss various issues arising in development such as mutual exclusion of a transaction table, mutual exclusion of indexes and system catalogs, and realtime application supports.

• The KIPS Transactions:PartC
• /
• v.10C no.4
• /
• pp.433-440
• /
• 2003

According as the real economic activities are carried out in the cyber world and the identity problem of a trade counterpart emerges, digital signature has been diffused. Due to the weakness for real-time validation using the validation method of digital signature, Certificate Revocation List, On-line Certificate Status Protocol was introduced. In this case, every transaction workload requested to verify digital signature is concentrated of a validation server node. Currently this method has been utilized on domestic financial transactions, but sooner or later the limitation will be revealed. In this paper, the validation method will be introduced which not only it can guarantee real-time validation but also the requesting node of certificate validation can maintain real-time certificate status information. This method makes the revocation management node update the certificate status information in real-time to the validation node while revoking certificate. The characteristic of this method is that the revocation management node should memorize the validation nodes which a certificate holder uses. If a certificate holder connects a validation node for the first time, the validation node should request its certificate status information to the above revocation management node and the revocation management node memorizes the validation node at the time. After that, the revocation management node inform the revocation information in real-time to all the validation node registered when a request of revocation happens. The benefits of this method are the fact that we can reduce the validation time because the certificate validation can be completed at the validation node and that we can avoid the concentration of requesting certificate status information to a revocation node.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.11
• /
• pp.127-133
• /
• 2019

SQL is the most common language in data processing. Therefore, most of the colleges offer SQL in their curriculum. In this research, an auto scoring SQL test is proposed for the efficient results of SQL education. The system was treated with algorithms instead of using expensive DBMS(Data Base Management System) for automatic scoring, and satisfactory results were produced. For this system, the test question bank was established out of 'personnel management' and 'academic management'. It provides users with different sets of test each time. Scoring was done by dividing tables into two sections. The one that does not change the table(select) and the other that actually changes the table(update, insert, delete). In the case of a search, the answer and response were executed at first and then the results were compared and processed, the user's answers are evaluated by comparing the table with the correct answer. Modification, insertion, and deletion of table actually changes the data table, so data was restored by using ROLLBACK command. This system was implemented and tested 772 times on the 88 students in Computer Information Division of our college. The results of the implementation show that the average scoring time for a test consisting of 10 questions is 0.052 seconds, and the performance of this system is distinguished considering that multiple responses cannot be processed at the same time by a human grader, we want to develop a problem system that takes into account the difficulty of the problem into account near future.

• Knowledge Management Research
• /
• v.22 no.3
• /
• pp.253-271
• /
• 2021

Due to the spread of COVID-19, the use of O2O order·delivery applications are becoming very common. Unlike the past, where customers could choose the desired transaction method and channel, these days, where customers' choices are very limited, it is urgent to consider the concept of shadow labor which has been hindered by the convenience and the benefits of order·delivery app. To this end, in this study, the service quality factors perceived by users of O2O order·delivery app and their shadow work attributes were identified, and priorities according to their relative importance and satisfaction level were suggested. In order to fulfill research objectives, first, after collecting user reviews for an O2O order·delivery app, the subject words were derived using topic modeling. Research variables were selected by linking 11 keywords with the concepts of previous studies on service quality of mobile apps and those about shadow labor. Eight variables of usefulness, ease of use, stability, design quality, personalization, responsiveness, update, and presence were selected. Based on 32 measurement items from the variables, a revised IPA was conducted, and finally, 'keep', 'concentrate', 'low priority', or 'overkill' service quality factors are revealed.