• Title/Summary/Keyword: transaction

Search Result 2,936, Processing Time 0.029 seconds

A Study on the Improvement of Online Secondhand-Goods Transaction (온라인 중고거래 중개자에 관한 문제점과 개선방안)

  • Jo, Ah Reum;Shin, Hyun Joo;Kim, Juchan
    • Journal of Information Technology Services
    • /
    • v.14 no.1
    • /
    • pp.69-83
    • /
    • 2015
  • The e-commerce market has been more diversified via B2B or P2P, and the size of this market has gradually been expanded as well. A noteworthy phenomenon is the P2P market, which has shown a rapid, approximately 200-fold or more increase in size since 2005. Specifically, the online secondhand-goods market that makes transaction easier and more convenient has attained a fast growth as well, but either sellers or buyers of secondhand goods are properly protected due to a lack of legal regulations on secondhand-goods transaction. The purpose of this study was to examine problems with online secondhand-goods transaction and to suggest some reform measures. There is something wrong with the legal status of brokers for secondhand-goods sales. According to the current law, individual brokers are neither mail-order sellers nor mail-order brokers. So they don't have lots of liabilities, and it means that the burden of risk is all imposed on buyers. Therefore it's suggested that individual brokers should be defined as 'involved operator of electronic commerce' so that proper liability might be imposed on them.

A Study for Transaction Processing Supporting Scalability in the Cloud (클라우드 환경에서 확장성을 지원하는 트랜잭션 처리 방법)

  • Kim, Chi-Yeon
    • 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.

Efficient Concurrency Control Method for Firm Real-time Transactions (펌 실시간 트랜잭션을 위한 효율적인 병행수행제어 기법)

  • Shin, Jae-Ryong
    • 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.

Understanding the Drivers for Migration to Innovation Ecosystem : The Influence of Standard on the Evolutionary Change of Capability Distribution and Transaction Costs (혁신 생태계 변화의 동인에 대한 이론과 사례 연구 : 표준이 역량분포와 거래비용의 진화적 변화에 미치는 영향 분석을 중심으로)

  • Kim, Min-Sik;Kim, Eonsoo
    • Journal of Information Technology Services
    • /
    • v.12 no.3
    • /
    • pp.1-21
    • /
    • 2013
  • This study attempts to explain the mechanism behind the migration from vertically integrated value chain architecture to an innovation ecosystem consisting of horizontally separated layers in value chain. We first present a comprehensive framework based on the theoretical analysis of the drivers for migration to an innovation ecosystem, which are standard (institution), capability distribution, and transaction costs. The theoretical framework suggests that the migration to an innovation ecosystem is explained by the influence of standard on the evolutionary change of capability distribution and transaction costs. In particular, when the new de-jure standard competes with the de-facto standard, the new de-jure standard has the greatest impact on the distribution capabilities and the transaction costs. Based on this theoretical framework, we analyze the latest SDN (Software Defined Networking) case of the network industry. SDN standard has transformed the industry from a vertically integrated value chain architecture to a horizontally separated one with its influence on the distribution capabilities and the transaction costs in the industry.

An Efficient Altruistic Looking Protocol for the Mobile Transaction Management System (이동 데이터베이스 시스템을 위한 효율적인 이타적 잠금기법)

  • 권혁신;김세윤;김응모
    • 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.

  • PDF

Applications of Transaction Log Analysis for the Web Searching Field (웹 검색 분야에서의 로그 분석 방법론의 활용도)

  • Park, So-Yeon;Lee, Joon-Ho
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.41 no.1
    • /
    • pp.231-242
    • /
    • 2007
  • Transaction logs capture the interactions between online information retrieval systems and the users. Given the nature of the Web and Web users, transaction logs appear to be a reasonable and relevant method to collect and investigate information searching behaviors from a large number of Web users. Based on a series of research studies that analyzed Naver transaction logs, this study examines how transaction log analysis can be applied and contributed to the field of web searching and suggests future implications for the web searching field. It is expected that this study could contribute to the development and implementation of more effective Web search systems and services.

An Efficient Security Protocol for Transaction in Mobile Data Network (모바일 데이터 망에서의 거래를 위한 효율적인 보안 프로토콜)

  • Kim, Jang-Hwan;Rhee, Chung-Sei
    • Convergence Security Journal
    • /
    • v.6 no.2
    • /
    • pp.43-51
    • /
    • 2006
  • The existing electronic transaction protocol uses a cryptography algorithm that is not suitable for mobile environment because of limited memory and process ability. In this paper, we propose an efficient transaction protocol suitable for mobile embedded system. The proposed protocol reduces computation and process time by using ID-based cryptography algorithm and ECC (elliptic curve cryptosystem). It uses vendor authentication only in the first transaction, and from the second transaction, it requires transaction after authentication with session created by applying ECC technique. Therefore, the creation number of authentication for the vendor can be reduced from n to one. And it reduces process time because it provides the same security with 160 bits as with 1024 bits of RSA.

  • PDF

A Study on the Improvement of Digital Content Distribution System - The Focus of Digital Content Transaction Authentication System - (디지털콘텐츠 유통 활성화를 위한 제도개선방안 연구 - 디지털콘텐츠 거래인증제도를 중심으로 -)

  • O, Sang-Hun;Ham, Jeong-Hun;Park, Yeo-Won;Lee, Yong-Gyu
    • 한국디지털정책학회:학술대회논문집
    • /
    • 2003.12a
    • /
    • pp.45-57
    • /
    • 2003
  • In recent years, the number of digital content transaction has increased dramatically, in main, owing to the innovation of IT technology. At the same time, it creates new problems which have never been found in traditional transactions. Especially, due to the easy-copy characteristics of digital content, the illegal usage of digital content proliferates. Also the conflicts between seller an d buyer in digital content transactions on cyberspace market take place frequently because contracts were made without face-to-face discussion. The increase of illegal usage and conflict in digital content market would diminish motivation of creators for their work, furthermore break down digital content market on cyberspace. Digital content transaction authentication system would play an important role in creating sound digital content market. Especially, it would make big contribution to reducing the number of conflict between seller and buyer. In this context, the main objective of this study is to suggest operational model of digital content transaction authentication and to explain critical success factors in organizing digital content transaction authentication system.

  • PDF

Transaction Processing Scheme for Mobile Database Systems (이동 데이터베이스체계를 위한 거래처리 기법)

  • 최용구
    • Journal of the Korea Society of Computer and Information
    • /
    • v.3 no.4
    • /
    • pp.19-26
    • /
    • 1998
  • Mobile database system address information processing based on database system in mobile computing environment. In the mobile database system, when a mobile transaction host enter a other radio coverage area called a cell while processing a transaction, it have to alter the communication network address to new database server. This is called transactional service handoff. This paper propose a transaction processing scheme for providing the proper function of this transactional service handoffs in mobile database system. This scheme apply coordinator migration mechanism which perform the transaction in new database server when posed to be the transaction service handoff. Fially, the proposed scheme will improve system performance by minimizing the tansmission of message for processing the transactions in mobile database system.

  • PDF

Research on Covert Communication Technology Based on Matrix Decomposition of Digital Currency Transaction Amount

  • Lejun Zhang;Bo Zhang;Ran Guo;Zhujun Wang;Guopeng Wang;Jing Qiu;Shen Su;Yuan Liu;Guangxia Xu;Zhihong Tian;Sergey Gataullin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.4
    • /
    • pp.1020-1041
    • /
    • 2024
  • With the development of covert communication technologies, the number of covert communication technologies using blockchain as a carrier is increasing. However, using the transaction amount of digital currency as a carrier for covert communication has problems such as low embedding rate, large consumption of transaction amount, and easy detection. In this paper, firstly, by experimentally analyzing the distribution of bitcoin transaction amounts, we determine the most suitable range of amounts for matrix decomposition. Secondly, we design a novel matrix decomposition method that can successfully decompose a large amount matrix into two small amount matrices and utilize the elements in the small amount matrices for covert communication. Finally, we analyze the feasibility of the novel matrix decomposition method in this scheme in detail from four aspects, and verify it by experimental comparison, which proves that our scheme not only improves the embedding rate and reduces the consumption of transaction amount, but also has a certain degree of resistance to detection.