• International Commerce and Information Review
• /
• v.12 no.4
• /
• pp.405-427
• /
• 2010

This legal study is to compare the Electronic Transactions Act in Thailand(hereinafter 'ETA') with mainly other countries electronic transactions acts, such as UNCITRAL MLEC, UECIC, VETA, UCITA and Korea' Electronic Transactions Act The ETA is consisted of 6 chapters which included preamble and definitions. Each chapter's main point as follows. Preamble is related to the name, time of legal effect, scope and definitions. Chapter 1 is not only general principles of electronic transactions, required restriction in addition to specify the limit of application, documentation, evidential weight in reference to the data message, but also the conditions of offer and acceptance through data message, time and place of dispatch and receipt of data message, certification between origination and addressee. According to media-neutrality and the effectiveness security requirement of data message under the information system, legal certification is related to the exchange's declaration of intention, define about origination-addressee of data message. Chapter 2 is composed to provide expressly about the effectiveness security in electronic signature. Those contents are to compare the MLEC, UECIC and Electronic Transactions Act in Korea. Chapter 3 is related to legal definitions that present legal requirement about service relating electronic transaction which contents accept domestic law, the adequate requirement as eligibility, satisfied matter, self-reliance ratio of finance and other detail standard Chapter 4 is deal with the transaction which are public sector and those application requirements. And also this chapter are composed regulations about direct-indirect purpose of Thailand domestic electronic government.

• 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 KIISE:Databases
• /
• v.33 no.1
• /
• pp.69-85
• /
• 2006

Broadcast has been often used to disseminate the frequently requested data efficiently to a large volume of mobile clients over a single or multiple channels. Conventional concurrency control protocols for mobile transactions are not suitable for the wireless broadcast environments due to the limited bandwidth of the up-link communication channel. In wireless broadcast environments, the server often broadcast different data items with different frequency to incorporate the data access patterns of mobile transactions. The previously proposed concurrency control protocols for mobile transactions in wireless broadcast environments are focused on the mobile transactions with uniform data access patterns. However, these protocols perform poorly when the data access pattern of update mobile transaction are not uniform but skewed. The update mobile transactions with skewed data access patterns will be frequently aborted and restarted due 4o the update conflict of the same data items with a high access frequency. In this paper, we propose an energy-efficient concurrence control protocol for mobile transactions with skewed data access as well as uniform data access patterns. Our protocol use a random back-off technique to avoid the frequent abort and restart of update mobile transactions. We present in-depth experimental analysis of our method by comparing it with existing concurrency control protocols. Our performance analysis show that it significantly decrease the average response time, the amount of upstream and downstream bandwidth usage over existing protocols.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1655-1673
• /
• 2018

Mobile computing environment is subject to the constraints of bounded network bandwidth, frequently encountered disconnections, insufficient battery power, and system asymmetry. To meet these constraints and to gain high scalability, data broadcasting has been proposed on data transmission techniques. However, updates made to the database in any broadcast cycle are deferred to the next cycle in order to appear to mobile clients with lower data currency. The main goal of this paper is to enhance the transaction performance processing and database currency. The main approach involves decomposing the main broadcast cycle into a number of sub-cycles, where data items are broadcasted as they were originally sequenced in the main cycle while appearing in the most current versions. A concurrency control method AOCCRBSC is proposed to cope well with the cycle decomposition. The proposed method exploits predeclaration and adapts the AOCCRB method by customizing prefetching, back-off, and partial backward and forward validation techniques. As a result, more than one of the conflicting transactions is allowed to commit at the server in the same broadcast cycle which empowers the processing of both update and read-only transactions and improves data currency.

• The Journal of Asian Finance, Economics and Business
• /
• v.8 no.2
• /
• pp.617-624
• /
• 2021

The purpose of this study is to develop a Technology Acceptance Model (TAM), to determine differences in gender perceptions in adopting non-cash transactions. In this study, the authors provide a measurement of differences in gender perceptions in adopting cashless, which refers to perceived usefulness, perceived ease-of-use, and perceived security. Respondents in this study were students from the millennial generation who are very familiar with the use of technology, especially non-cash transactions. The data collection technique used in this study was a survey, by distributing questionnaires to 260 respondents. The data were processed statistically through Structural Equation Modeling (SEM). The results of this study indicate that for men, ease-of-use of transactions does not increase the use of non-cash transactions. Meanwhile, for women, perceived ease-of-use has a significant and positive effect on the use of non-cash transactions. Furthermore, perceptions of usability and security have a positive and significant impact on using non-cash transactions. It was also found that female students had a positive, but not significant, effect on the use of non-cash transactions. This means that there has been a difference in the perception of gender, between men and women, in responding to the use of non-cash transactions.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.210-212
• /
• 2000

In this paper, we present a comcurrency control scheme over the index structure in main memory databases using multiversion mechanism, and implement it on T-tree. As a well-known idea for comcurrency control, multiversion allows multiple transactions to reat and write different versions of the same data item, each transaction sees a consistent set of versions for all the data items it accesses[1]. Logical versioning and physical versioning techniques are used to keep versions of data item and versions of index node respectively. The main features of this multiversion indexing approach are (1)update operations and rotations on T-tree can take place concurrently, (2)the number of locking and latching requirement is sharply reduced because read-only transactions do not obtain any locks or latches and update transactions obtain latches only when actually performing the update, (3)it reduces storage overhead for tracking version and reclaims storage in time, and (4)it provides complete isolation of read-only transactions from update transactions, so the read-only transactions can get response information without any block.

• Journal of KIISE:Software and Applications
• /
• v.26 no.1
• /
• pp.80-80
• /
• 1999

As Temporal DataBase Systems(TDBSs) manages both the historical versions and the current version of each data item, a temporal transaction may access more data records than atransaction in traditional database systems. Hence, the concurrency control subsystem of temporaldatabase management system should be able to correctly and efficiently detect actual conflicts amongconcurrent temporal transactions while the cost of detecting conflicts is maintained in low levelwithout detecting false conflicts which cause severe degradation of system throughput.In this paper, Two-Level Conflict Detection(TLCD) scheme is proposed for efficient conflictdetection between concurrent temporal transactions in TDBs. In the proposed TLCD scheme, sincechecking conflict between concurrent temporal transactions is performed at two levels, i, e., logicallevel and physical level, conflicts between concurrent temporal transactions are efficiently and correctlydetected,Furthermore, we also evaluate the performance of the proposed TLCD scheme with those oftraditional conflict detection schemes, logical-level conflict detection scheme and physical-level conflictdetection scheme by simulation approach, The result of the simulation study shows that the proposedTLCD scheme outperforms the previous conflict detection schemes with respect to the averageresponse time.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.803-816
• /
• 1996

It is possible to prevent deadlock if the priority which is conventionally given to transactions is endowed to data items and the transactions with the highest priority among transactions accessing the data item is allowed to proceed. Based on this observation, we proposed a Data-Priority Based Locking Protocol(DPLP) and evaluated its performance against known locking protocols in Real Time Database Management System(RTDBMS). Transaction inter-arrival time(IAT) was varied to determine success ratio, average-lateness, confict ratio and restart ratio, In these simulations we verified that the proposed DPLP performs better than the other protocols.

• International Journal of Computer Science & Network Security
• /
• v.24 no.4
• /
• pp.1-10
• /
• 2024

In the era of big data, the growth of e-commerce transactions brings forth both opportunities and risks, including the threat of data theft and fraud. To address these challenges, an automated real-time fraud detection system leveraging machine learning was developed. Four algorithms (Decision Tree, Naïve Bayes, XGBoost, and Neural Network) underwent comparison using a dataset from a clothing website that encompassed both legitimate and fraudulent transactions. The dataset exhibited an imbalance, with 9.3% representing fraud and 90.07% legitimate transactions. Performance evaluation metrics, including Recall, Precision, F1 Score, and AUC ROC, were employed to assess the effectiveness of each algorithm. XGBoost emerged as the top-performing model, achieving an impressive accuracy score of 95.85%. The proposed system proves to be a robust defense mechanism against fraudulent activities in e-commerce, thereby enhancing security and instilling trust in online transactions.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.5
• /
• pp.1143-1152
• /
• 1999

A Mobile computing environment is a new paradigm which provides users with the access to information irrespective of users' location. A transaction scheduling method for the mobile computing environment must be designed so that database consistency is maintained with considering the limited performance of mobile hosts and the narrow bandwidth of a wireless network. The scheduling method using a lock has some problems: the high message overhead between a server and a mobile host for maintaining a lock and the high abort ratio of the mobile transactions owing to violating the serializability when a mobile host uses a cache. So, in this paper, we propose an efficient transaction management method using timestamp to resolve these problems. The proposed method is used in the environment under which a mobile host uses a cache having two versions for each cached data item and a server maintains several versions for each data item. So, even though a mobile transaction is executed during several broadcasting interval, can be committed. As a result, the proposed method can improve the commit ratio of the mobile transactions by maintaining multiversion for each data item and does not require the additional message exchange to schedule transactions by using timestamp.