• 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 INTERNATIONAL COMMERCE & LAW REVIEW
• /
• v.29
• /
• pp.143-172
• /
• 2006

This study focuses on the risk management of "Digital Goods" appeared with the progress of information technology(IT) in international transaction. As a result of that digital goods have a lot of uncertainty between the general goods or service which have been deal with object of international transaction broadly because digital goods hold uniqueness. In this study, the author give a definition of "Digital Goods" and make an examination of uniqueness of that in international transaction. Next, six risks are defined base on risk theory and risk analysis matrix applying risk mapping model is made. Conclusionally, risk transfer as insurance is adequate to manage business risk, security risk, credit risk and legal risk. Meanwhile, risk avoidance is adequate to manage reputation risk and market risk. But, this study have following three limits. Firstly, concerning definition of the risk, real case is not applied owing to lack of transaction data. Secondly, measuring of the risk is not based on absolute data but relative data. Lastly, suggesting way of risk management is not concrete and practical to international trader of digital goods.

• Journal of Korea Multimedia Society
• /
• v.12 no.1
• /
• pp.41-49
• /
• 2009

Smart Card is currently more popular in mobile communication, and smart card with java card platform becomes a standard choice. Java card has a problem that it gets lost working data when power is off. Transaction is the idea to solve a problem of data loss, but it accepts only one transaction process, and other transaction process need to hold until the current working transaction is finished. This might be a factor to drop the Java card's performance. In this paper, we define a rule of dual-lock which can run transaction at multiple transaction buffer as a method for a better java card performance, and we suggest this rule to improve a capability of transaction process. From this research, we are able to improve the data stability, reduce the java card transaction delay time, and get a higher processing speed of java card.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.4
• /
• pp.873-879
• /
• 2012

Recently the cloud computing paradigm has been widely accepting in various applications. Data management system of cloud computing requires ability to manage tremendous data and supporting scalability. The former can be achieved by weaken consistency and limitation of transactions, and the latter needs expand or shrink of components. In this paper, we propose a transaction processing model and a scalable module management algorithm when transaction is executed in the cloud. Transaction processing model consists of a transaction management module and a data management module. Scalable module management algorithm has no redistribution of components and may alleviates loads of existed modules. With simulation results, we can see the improvement of response time and decrease abort ratio of transactions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4B
• /
• pp.285-290
• /
• 2006

Various aspects should be taken into account while developing a distributed architecture based on a multi-tier model or an enterprise architecture. Among those, the separation of role between page designer and page developer, defining entity which is used for database connection and transaction processing are very much important. In this paper, we presented DONSL(Data Server of Non SQL query) architecture to solve these problems applying web tier object modelling. This architecture solves the above problems by simplifying tiers coupling and removing DAO(Data Access Object) and entity from programming logic. We concentrate upon these three parts. One is about how to develop the DAO not concerning the entity modification, another is automatic transaction processing technique including SQL generation and the other is how to use the AET/MET(Automated/Manual Execute d Transaction) effectively.

• Journal of agricultural medicine and community health
• /
• v.49 no.1
• /
• pp.59-70
• /
• 2024

Objectives: This research analyzed and compared housing transaction prices and depression rates according to housing types before and after the COVID-19 pandemic. Methods: Data on housing transaction prices and depression rates from 2018 to 2022 in 25 districts of Seoul, South Korea, were utilized. Dummy variables were employed to account for potential confounders influencing the relationship between the variables. Statistical analysis was conducted using R, and the relationship between depression rates and housing transaction prices was examined through Ordinary Least Squares (OLS) and panel data regression analysis. Results: The results of OLS and one-way random effects models indicated a significant relationship between apartment (p<.05) and officetel (p<.001) transaction prices and depression. However, detached/semi-detached and row/townhouse transaction prices did not exhibit a significant relationship with depression. Conclusion: It was observed that as apartment and officetel transaction prices increased in Seoul before and after the COVID-19 pandemic, depression rates also increased. Considering that changes in housing prices by housing type in South Korea may impact the mental health of local residents, it is deemed necessary to consider healthy housing and housing prices as comprehensive determinants of mental health.

• Knowledge Management Research
• /
• v.21 no.1
• /
• pp.117-136
• /
• 2020

In the studies for the recommender systems which solve the information overload problem of users, the use of transactional data has been continuously tried. Especially, because the firms can easily obtain transactional data along with the development of IoT technologies, transaction-based recommender systems are recently used in various areas. However, the use of transactional data has limitations that it is hard to reflect domain knowledge and they do not directly show user preferences for individual items. Therefore, in this study, we propose a method applying the word embedding in the transaction-based recommender system to reflect preference differences among users and domain knowledge. Our approach is based on SAR, which shows high performance in the recommender systems, and we improved its components by using FastText, one of the word embedding techniques. Experimental results show that the reflection of domain knowledge and preference difference has a significant effect on the performance of recommender systems. Therefore, we expect our study to contribute to the improvement of the transaction-based recommender systems and to suggest the expansion of data used in the recommender system.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.4
• /
• pp.29-39
• /
• 2002

The transaction tables of the existing association algorithms have two column attributes : It is composed of transaction identifier (Transaction_id) and an item identifier (item). In this kind of structure, as the volume of data becomes larger, the performance for the SQL query statements came applicable decreases. Therefore, we propose advanced association rules algorithm of n-items which can transact multiple items (Transaction_id, Item 1, Item 2…, Item n). In this structure, performance hours can be contracted more than the single item structures, because count can be computed by query of the input transaction tables. Our experimental results indicate that performance of the n items structure is up to 2 times better than the single item. As a result of this paper, the proposed algorithm can be applied to internet shopping, searching engine and etc.

• Journal of the military operations research society of Korea
• /
• v.22 no.1
• /
• pp.81-96
• /
• 1996

In a relational database environment, partitioning of data is directly concerned with the amount of data that needs to be required in a query or transaction. In this paper, we consider non-overlapping, vertical partitioning. Vertical partitioning algorithm in this paper is composed of two phases. In phase 1, we cluster the attributes with zero-one integer program that maximize affinity among attributes. The result of phase 1 is called 'Initial Fragments'. In phase 2, we modify Initial Fragments that is not directly considered by cost factors, making use of a transaction-based partitioning method. A transaction-based partitioning method is partitioning attributes according to a set of transactions. In this phase we select logical accesses which needs to be required in a transaction as comparison criteria. In phase 2, proposed algorithm consider only small number of modification of Initial Fragments in phase 1. This algorithm is so insensible to number of transactions and of attributes that it can applied to relatively large problems easily.

• Korea Trade Review
• /
• v.46 no.2
• /
• pp.93-106
• /
• 2021

This study analyzes trade communication methods by comparing and analyzing payment methods and procedures of L/C and BPO transactions. As a result of the study, BPO transaction is validated based on the combination results of the confirmed baseline and data set unlike the L/C transaction. Therefore, BPO is superior to L/C transaction in that there is no confrontation between the parties over the matching results. And it can proceed with certain transaction that is paid first and proved later. In addition, the process of accepting data mismatches results in a confirmation of the payment commitment considering the intention of the importer. This allows flexible disposition of documents in response to the post payment situation as long as the documents are held by the exporter, which can be said to be superior to the L/C transaction.