• Electronics and Telecommunications Trends
• /
• v.37 no.3
• /
• pp.85-96
• /
• 2022

Recently, the blockchain technology, which can decentralize business ecosystems using secure transactions without trusted intermediaries, has been spotlighted. Full nodes play an important role in maintaining decentralization in that they independently verify transactions using their full historical transaction data. However, the storage requirement of a full node for storing historical data is continuously increasing, and thus, has become harder for users to run a full node due to the heavy price for storage costs. In this paper, we investigate research trends on reducing the costs of storing blockchain transaction data so that nodes with low storage requirements can be used in the blockchain network.

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

Transactions in real-time active databases have the notion of activeness where transactions are generated by external effects and another transaction. In this paper, we propose the multi version concurrency control algorithm for real-time active transactions. A real-time active transaction has a timing constraint in the form of a deadline until which the user wants to complete the transaction, and is characterized by triggering relationships which mean that association between a transaction that triggers the execution of another transaction and the triggered transaction. The triggering relationship is an important factor to resolve data conflicts among real-time active transactions. The proposed concurrency control mechanism resolves data conflicts by considering triggering relationships between conflicting transactions as well as priorities and precedence relationships. The conflict resolution mechanism considers association types of the triggering relationship such as abort and commit dependency, and then resolves data conflicts in favor of higher priority transactions. We also present the experimental results of our algorithm comparing other real-time active concurrency control algorithms.

• The KIPS Transactions:PartD
• /
• v.11D no.6
• /
• pp.1213-1220
• /
• 2004

With the significant advances in mobile computing technology, there is an increasing demand for various mobile applications to process trans-actions in a real-time. When remote data access is considered in a mobile environment, data access delay becomes one of the most serious problems in meeting the deadline of real-time transaction. The mobile real-time transaction should be assured not only correctness of result of trans-action but also completion time of transaction. In this paper, we propose an optimistic concurrency control method to solve conflict among mobile real-time transactions. It minimizes influence on the cascade abort and delay of transactions that occur by disconnection and hand over in a mobile environment.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.10a
• /
• pp.22-26
• /
• 2018

In this paper, we propose a model that classifies different transaction information by clustering and learning through similarity and transaction pattern of cryptocurrency transaction information. By using characteristics of genetic algorithms, we can get better clustering performance by eliminating unnecessary elements in clustering process. The transaction information including the clustering value is set as the training data, and the transaction information can be predicted through the classification algorithm. This can be used to automatically detect abnormal transactions from various transaction information of the cryptocurrency.

• The Journal of the Korea Contents Association
• /
• v.17 no.2
• /
• pp.543-554
• /
• 2017

We tried to get useful information from social network analysis on the transaction network for the companies in Busan, Ulsan, Kyong-nam region using more than 80 thousand company transaction data obtained from Korean enterprise data (KED). We found that there are 282 clusters having more than 3 companies when we made clusters composed of the companies having the transactions with each other as the first transaction partners in the region. Most of clusters have a major big company with most of sales in the clusters and have the member companies without the transaction with other cluster's member companies so that they have closed and hierarchical transaction pattern. Analysing the transaction network using the network index, we know that there are small medium size companies playing the central role in the regional transaction network and a few clusters have many transactions with other clusters. Also we found that there are very rare sale transactions to the companies outside the region and many purchasing transactions from the companies outside the region. Policy makers need to try to diversify the transaction patterns and to use the exceptional companies and clusters as the levers.

• Journal of Information Technology Applications and Management
• /
• v.15 no.4
• /
• pp.37-59
• /
• 2008

This study focuses on the antecedents to the privacy concerns and their influence on trust and online transaction intention. Based on previous exploratory works and the literature review of privacy concerns, four antecedents are identified-Internet literacy, social awareness, perceived vulnerability, and perceived ability to information control. Incorporating these antecedents, privacy concerns, trust and online transaction intention, a conceptual model is developed and seven research hypotheses are proposed for empirical testing. The proposed model is examined through structural equation analysis. The results show that Internet literacy, social awareness, and perceived vulnerability have statistically significant effect on the privacy concerns of users and the privacy concerns has a positive influence on the trust. Finally, the trust has a positive effect on the online transaction intention. Implications of these findings are discussed for both researchers and practitioners and future research issues are raised as well.

• Journal of KIISE:Databases
• /
• v.32 no.3
• /
• pp.219-227
• /
• 2005

In this paper, we propose an efficient algorithm which generates frequent itemsets by only one database scanning. A frequent itemset is subset of an itemset which is accessed by a transaction. For each item, if informations about transactions accessing the item are exist, it is possible to generate frequent itemsets only by the extraction of items haying an identical transaction ID. Proposed method in this paper generates the data structure which stores transaction ID for each item by only one database scanning and generates 2-frequent itemsets by using the hash technique at the same time. k(k$\geq$3)-frequent itemsets are simply found by comparing previously generated data structure and transaction ID. Proposed algorithm can efficiently generate frequent itemsets by only one database scanning .

• The Journal of Asian Finance, Economics and Business
• /
• v.7 no.10
• /
• pp.697-706
• /
• 2020

This study investigates the relationship between related loan, ownership concentration and real estate firm performance. The data was collected from 35 real estate firms listed on Indonesia Stock Exchange from 2007 to 2012. Related loans are viewed from the angle of related lending and loan. Related lending and loan is measured by the related lending on total lending ratio and related loan on total loan ratio. Firm performance is measured by the asset turnover ratio and return on assets ratio. Ownership concentration is measured by the right cash flow. The data analysis was done with regression analysis and panel data. The results of the study found that related loans had a positive effect on sales but had no effect on profits. This supports the efficient transaction hypothesis. On the other hand, related lending has a positive effect on profits that supports opportunistic transactions. Ownership concentration moderates the effect of related loan on company's performance. The related lending are beneficial for mutually supporting activities in the real estate sector business group in Indonesia, but related loans have the potential to be used in tunneling activities. The paper contributes to the related party transaction in benefits-risks of related lending and related loan in uncertainty context.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.648-651
• /
• 2002

In data broadcast environments, data is disseminated from a small number of sewers to a much larger number of clients. The advancing technology of hardware and increasing needs of users' have extended a broadcast environments. A mobile environment use the data broadcasting. A user carrying a portable computer can submit the operations of a transaction. Some limitations such as the poor-resource, user mobility, and low bandwidth are difficult to apply traditional transaction management to the mobile environments. So, the new mechanisms are needed and one of the them is the correctness criteria of transactions. Serializability is the most used criteria, but serializability is not appropriate to the broadcast environment because unnecessary abort and additional message exchanges are occurred. Hence, in this paper, we will address the need of the new correctness criteria weaker than serializability and describe the adoption of the update consistency.

• Journal of Korean Institute of Industrial Engineers
• /
• v.32 no.3
• /
• pp.242-252
• /
• 2006

Data mining is the exploration and analysis of huge amounts of data to discover meaningful patterns. One of the most important data mining problems is association rule mining. Recent studies of mining association rules have proposed a closure mechanism. It is no longer necessary to mine the set of all of the frequent itemsets and their association rules. Rather, it is sufficient to mine the frequent closed itemsets and their corresponding rules. In the past, a number of algorithms for mining frequent closed itemsets have been based on items. In this paper, we use the transaction itself for mining frequent closed itemsets. An efficient algorithm is proposed that is based on a link structure between transactions. Our experimental results show that our algorithm is faster than previously proposed methods. Furthermore, our approach is significantly more efficient for dense databases.