• 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 Processing Systems
• /
• v.13 no.6
• /
• pp.1575-1584
• /
• 2017

As interest in big data has increased recently, NoSQL, a solution for storing and processing big data, is getting attention. NoSQL supports high speed, high availability, and high scalability, but is limited in areas where data integrity is important because it does not support multiple row transactions. To overcome these drawbacks, many studies are underway to support multiple row transactions in NoSQL. However, existing studies have a disadvantage that the number of transactions that can be processed per unit of time is low and performance is degraded. Therefore, in this paper, we design and implement a multi-row transaction system for data integrity in big data environment based on HBase, a column-based NoSQL which is widely used recently. The multi-row transaction system efficiently performs multi-row transactions by adding columns to manage transaction information for every user table. In addition, it controls the execution, collision, and recovery of multiple row transactions through the transaction manager, and it communicates with HBase through the communication manager so that it can exchange information necessary for multiple row transactions. Finally, we performed a comparative performance evaluation with HAcid and Haeinsa, and verified the superiority of the multirow transaction system developed in this paper.

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

• The Journal of Information Technology
• /
• v.3 no.3
• /
• pp.117-134
• /
• 2000

Client-server DBMS based on a data-skipping model can exploit client resources effectively by allowing inter-transaction caching. However, inter-transaction caching raises the need of transactional cache consistency maintenance(TCCM) protocol, since each client is able to cache a portion of the database dynamically. Detection-based TCCM schemes can reduce the message overhead required for cache consistency if they validate clients replica asynchronously, and thus they cm show high throughput rates. However, they tend to show high ratios of transaction abort since transactions can access invalid replica. For coping with this drawback, this paper develops a new notion of shadow transaction, which is a backup-purpose one that is kept ready to replace an aborted transaction. This paper proposes a new detection-based TCCM scheme named DL-ST on the basis of the notion of shadow transaction. Using a simulation model, this paper evaluates the effect of shadow transaction in terms of transaction through rate and abort ratio.

• 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 Korean Institute of Industrial Engineers
• /
• v.42 no.4
• /
• pp.249-255
• /
• 2016

Recently, transaction data is accumulated everywhere very rapidly. Association analysis methods are usually applied to analyze transaction data, but the methods have several problems. For example, these methods can only consider one-way relations among items and cannot reflect domain knowledge into analysis process. In order to overcome defect of association analysis methods, we suggest a transaction data analysis method based on probabilistic graphical model (PGM) in this study. The method we suggest has several advantages as compared with association analysis methods. For example, this method has a high flexibility, and can give a solution to various probability problems regarding the transaction data with relationships among items.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11
• /
• pp.2845-2862
• /
• 1999

As the technical advances in portable computers and wireless communication technologies, mobile computing environment has been rapidly expanded. The mobile users on mobile host can access information via wireless communication from the distributed heterogeneous multidatabase system in which pre-existing independent local information systems are integrated into one logical system to support mobile applications. Hence, mobile transaction model should include not only the features for heterogeneous multidatabase systems but also the ones for mobile computing environment. In this paper, we proposed a mobile flex transaction model which extends the flexible transaction model that previously proposed for heterogeneous multidatabase systems is extended to support the requirements of mobile heterogeneous multidatabase systems. We also presented the execution control mechanism of the mobile flex transaction model. The proposed mobile flex transaction model allows the definition of location-dependent subtransactions, the effective support of hand-over, and the flexibility of transaction executions. Hence, the proposed mobile flex transaction model can be suit to mobile heterogeneous multidatabase systems that have low power capability, low bandwidth, and high communication failure possibility.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.10a
• /
• pp.68-98
• /
• 2004

Although the internet is useful for transferring information, Internet auction environments make fraud more attractive to offenders because the chance of detection and punishment are decreased. One of fraud is phantom transaction which is a colluding transaction by the buyer and seller to commit illegal discounting of credit card. They pretend to fulfill the transaction paid by credit card, without actual selling products, and the seller receives cash from credit card corporations. Then seller lends it out buyer with quite high interest rate whose credit score is so bad that he cannot borrow money from anywhere. The purpose of this study is to empirically investigate the factors to detect of the phantom transaction in online auction. Based up on the studies that explored behaviors of buyers and sellers in online auction, bidding numbers, bid increments, sellers' credit, auction length, and starting bids were suggested as independent variables. We developed an Internet-based data collection software agent and collect data on transactions of notebook computers each of which winning bid was over 1,000,000 won. Data analysis with logistic regression model revealed that starting bids, sellers' credit, and auction length were significant in detecting the phantom transaction.

• Journal of Distribution Science
• /
• v.16 no.12
• /
• pp.57-68
• /
• 2018

Purpose - The development of technologies lead the volume of sale on online market increase but an off-line shopping center is still a core component in the omni-channel strategy. It is generally thought that high-level retailtainment on brick and mortar store affects purchase intentions positively, but some previous studies dispute that and have reported that retailtainment does not affect purchase intentions. So we have studied the additional factors' effect - the nature of purchase and utility - with retailtainment. Research design, data, and methodology - There are 8 treatment groups which were assigned by the method of retailtainment (high vs. low), nature of purchase (essential vs. non-essential), and utility (acquisition vs. transaction). A total of 240 subjects (office workers = 163, 68%; undergraduates = 77, 32%; average age = 30s; female = 39%) were divided into groups and exposed to one of the eight scenarios. Participant's purchase intention was the dependent, and ANOVA and L-matrix were used to analyze for main and interactive effects between factors. Results - First, the main effect and interactive effect between retailtainment and the nature of purchase are significant. We also found that the contrast between essential and non-essential at low-level retailtainment is higher than that of high-level retailtainment. Second, in the case of retailtainment and utility, transaction utility under high-level retailtainment affects purchase intentions positively. Third, between the nature of the purchase and utility, the main effect of the nature of purchase and the interactive effect is significant, but the main effect of utility is not significant. In the case of non-essential goods, the purchase intention was high when transaction utility was provided but in the case of essential goods, acquisition utility increased purchase intentions. Finally, when transaction utility is given, purchase intentions of essential goods increase under low retailtainment, and the purchase intentions of non-essential goods increase under high retailtainment. Conclusions - When customers buy essential goods, discounts decrease purchase intentions. During the season for bargain sales, purchase intentions increase when retailtainment of essential goods is low, and retailtainment of non-essential goods is high.

• The Journal of the Korea Contents Association
• /
• v.10 no.7
• /
• pp.115-121
• /
• 2010

It always must guarantee preceding process of the transaction with the higher priority in real-time database systems. The pessimistic concurrency control method resolves a conflict through aborting or blocking of a low priority transaction. However, if a high priority transaction is eliminated in a system because of its deadline missing, an unnecessary aborting or blocking of a low priority transaction is occurred. In this paper, the proposed method eliminates a transaction that is about to miss its deadline. And it prevents needless wastes of resources and eliminates unnecessary aborting or blocking of a low priority transaction. It is shown through the performance evaluation that the proposed method outperforms the existing methods in terms of the deadline missing ratio of transactions.