• Title/Summary/Keyword: Transaction-Based Data

Search Result 543, Processing Time 0.022 seconds

Big Data Analysis of News on Purchasing Second-hand Clothing and Second-hand Luxury Goods: Identification of Social Perception and Current Situation Using Text Mining (중고의류와 중고명품 구매 관련 언론 보도 빅데이터 분석: 텍스트마이닝을 활용한 사회적 인식과 현황 파악)

  • Hwa-Sook Yoo
    • Human Ecology Research
    • /
    • v.61 no.4
    • /
    • pp.687-707
    • /
    • 2023
  • This study was conducted to obtain useful information on the development of the future second-hand fashion market by obtaining information on the current situation through unstructured text data distributed as news articles related to 'purchase of second-hand clothing' and 'purchase of second-hand luxury goods'. Text-based unstructured data was collected on a daily basis from Naver news from January 1st to December 31st, 2022, using 'purchase of second-hand clothing' and 'purchase of second-hand luxury goods' as collection keywords. This was analyzed using text mining, and the results are as follows. First, looking at the frequency, the collection data related to the purchase of second-hand luxury goods almost quadrupled compared to the data related to the purchase of second-hand clothing, indicating that the purchase of second-hand luxury goods is receiving more social attention. Second, there were common words between the data obtained by the two collection keywords, but they had different words. Regarding second-hand clothing, words related to donations, sharing, and compensation sales were mainly mentioned, indicating that the purchase of second-hand clothing tends to be recognized as an eco-friendly transaction. In second-hand luxury goods, resale and genuine controversy related to the transaction of second-hand luxury goods, second-hand trading platforms, and luxury brands were frequently mentioned. Third, as a result of clustering, data related to the purchase of second-hand clothing were divided into five groups, and data related to the purchase of second-hand luxury goods were divided into six groups.

A Study on the M2M Energy Trading System Using Proof of Location Blockchain Network (위치증명기반 블록체인 네트워크를 활용한 사물 간 에너지 직거래 시스템에 관한 연구)

  • Kim, Young-Gon;Heo, Keol;Choi, Jung-In
    • Journal of Energy Engineering
    • /
    • v.29 no.3
    • /
    • pp.86-90
    • /
    • 2020
  • This paper examines a blockchain network-based transaction system using location proofing in power direct transactions between networked energy clouds, energy communities, and prosumer machines participating in smart cities. It utilizes location-based blockchain network technology, which enables long-distance travel with recharging by power purchases during autonomous movements, autonomous electric vehicles that can purchase and sell electricity, and solar street lights that can be produced and sold in fixed form. In addition, it is possible to provide optimum power transaction matching and settlement reliability between machines without human intervention in power transactions between electric chargers. It also introduces a business-to-object business model between autonomous machines that exist in multiple and different spaces and through energy clouds that are expected to be scattered with various transaction prices, policies, and incentives.

Application Performance Evaluation in Main Memory Database System (메인메모리 데이터베이스시스템에서의 어플리케이션 성능 평가)

  • Kim, Hee-Wan;Ahn, Yeon S.
    • Journal of Digital Contents Society
    • /
    • v.15 no.5
    • /
    • pp.631-642
    • /
    • 2014
  • The main memory DBMS is operated which the contents of the table that resides on a disk at the same time as the drive is in the memory. However, because the main memory DBMS stores the data and transaction log file using the disk file system, there are a limit to the speed at which the CPU accesses the memory. In this paper, I evaluated the performance through analysis of the application side difference the technology that has been implemented in Altibase system of main memory DBMS and Sybase of disk-based DBMS. When the application performance of main memory DBMS is in comparison with the disk-based DBMS, the performance of main memory DBMS was outperformed 1.24~3.36 times in the single soccer game, and was outperformed 1.29~7.9 times in the soccer game / special soccer. The result of sale transaction response time showed a fast response time of 1.78 ~ 6.09 times.

Design and Implementation for Card Holder Initiated Card Payment System Using the Mobile Devices (모바일 기기를 활용한 고객 개시 카드결제 시스템 설계 및 구현)

  • Seo, Moon Seog
    • Journal of Information Technology Services
    • /
    • v.13 no.4
    • /
    • pp.245-254
    • /
    • 2014
  • Payment system is defined as the various contracts and operating facilities for the transfer of monetary value to clear the relationship between credit and debt. Payment systems essentially require the efficient and reliable operations. Card-based payment systems are developed practically and creatively in accordance with the progress of ICT. Especially in mobile environment with intelligent mobile devices such as smart-phones and tablets, a variety of payment services are provided. Existing card-based payment services are configured by the payment transaction initiated by the merchants card acceptance and then swiping into the CAT (Card Authorization Terminal) to begin the transaction. The merchant initiated payment services are now applied to the Wireless CAT (W-CAT) for mobile environment. That kind of payment services cause many problems such the illegal card information leaks and the lingering threat of W-CAT theft. Also, the use of many W-CATs increased cost to the merchant. In this paper, we propose the card holder initiated card payment system using the intelligent mobile devices in mobile environment for solving problems of the existing merchant initiated card payment system and coping effectively with the activation of a wireless data network and changes of information technology.

Border-based HSFI Algorithm for Hiding Sensitive Frequent Itemsets (민감한 빈발항목집합을 숨기기 위한 경계기반 HSFI 알고리즘)

  • Lee, Dan-Young;An, Hyoung-Keun;Koh, Jae-Jin
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.10
    • /
    • pp.1323-1334
    • /
    • 2011
  • This paper suggests the border based HSFI algorithm to hide sensitive frequent itemsets. Node formation of FP-Tree which is different from the previous one uses the border to minimize the impacts of nonsensitive frequent itemsets in hiding process, including the organization of sensitive and border information, and all transaction as well. As a result of applying HSFI algorithms, it is possible to be the example transaction database, by significantly reducing the lost items, it turns out that HSFI algorithm is more effective than the existing algorithm for maintaining the quality of more improved database.

Design and Implementation of Publish/Subscribe Model Based RPC Middleware (Publish/Subscribe 모델 기반 RPC 미들웨어 설계와 구현)

  • Park, Sanghyun;Choi, Junesung;Kook, Kwangho
    • Journal of IKEEE
    • /
    • v.19 no.3
    • /
    • pp.327-334
    • /
    • 2015
  • Various types of middle-ware were created for integration between legacy systems and newly built systems. RPC(Remote Procedure Call), MOM(Message Oriented Middle-ware) and TM(Transaction processing Monitor) are the typical types of middle-ware. One of the most known MOM type middle-ware is PS(Publish/Subscribe). PS enables to create a system which has low coupling and high scalability. But PS based systems also have low cohesiveness. On the contrary, RPC has high cohesiveness but also has high coupling. This paper proposed design and implementation of hybrid model which offset disadvantages of RPC and PS.

A Write Notification Approach for Optimistic Concurrency Control Schemes (낙관적 동시성 제어를 위한 쓰기 통지 기법)

  • SungChan Hong
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.5
    • /
    • pp.633-639
    • /
    • 2004
  • The performance of optimistic concurrency control schemes which are generally used for Mobile computing is very sensitive to the transaction abort rate. Even if the abort probability can be reduced by back-shifting the timestamp from the time of requesting a commit, some transactions continuously perform unnecessary operations after the transactions accessed write-write conflicting data. In this paper, we propose an optimistic protocol that can abort the transactions during the execution phase by using the write notification approach. The proposed protocol enhances the performance of the optimistic concurrency control by reducing the unnecessary operations. In addition, we present a simulation study that compares our schemes with the timestamp based certification scheme. This study shows that our scheme outperforms the timestamp based certification scheme.

  • PDF

Update Protocols for Web-Based GIS Applications (웹 기반 GIS 응용을 위한 변경 프로토콜)

  • An, Seong-U;Seo, Yeong-Deok;Kim, Jin-Deok;Hong, Bong-Hui
    • Journal of KIISE:Databases
    • /
    • v.29 no.4
    • /
    • pp.321-333
    • /
    • 2002
  • As web-based services are becoming more and more popular, concurrent updates of spatial data should be possible in the web-based environments in order to use the various services. Web-based GIS applications are characterized by large quantity of data providing and these data should be continuously updated according to various user's requirements. Faced with such an enormous data providing system, it is inefficient for a server to do all of the works of updating spatial data requested by clients. Besides, the HTTP protocol used in the web environment is established under the assumption of 'Connectionless'and 'Stateless'. Lots of problems may occur if the scheme of transaction processing based on the LAN environment is directly applied to the web environment. Especially for long transactions of updating spatial data, it is very difficult to control the concurrency among clients and to keep the consistency of the server data. This paper proposes a solution of keeping consistency during updating directly spatial data in the client-side by resolving the Dormancy Region Lock problem caused by the 'Connectionless'and 'Stateless'feature of the HTTP protocol. The RX(Region-eXclusive) lock and the periodically sending of ALIVE_CLIENTi messages can solve this problem. The protocol designed here is verified as effective enough through implementing in the main memory spatial database system, called CyberMap.

A study on the selection of the target scope for destruction of personal credit information of customers whose financial transaction effect has ended (금융거래 효과가 종료된 고객의 개인신용정보 파기 대상 범위 선정에 관한 연구)

  • Baek, Song-Yi;Lim, Young-Bin;Lee, Chang-Gil;Chun, Sam-Hyun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.3
    • /
    • pp.163-169
    • /
    • 2022
  • According to the Credit Information Act, in order to protect customer information by relationship of credit information subjects, it is destroyed and stored separately in two stages according to the period after the financial transaction effect is over. However, there is a limitation in that the destruction of personal credit information of customers whose financial transaction effect has expired cannot be collectively destroyed when the transaction has been terminated, depending on the nature of the financial product and transaction. To this end, the IT person in charge is developing a computerized program according to the target and order of destruction by investigating the business relationship by transaction type in advance. In this process, if the identification of the upper relation between tables is unclear, a compliance issue arises in which personal credit information cannot be destroyed or even information that should not be destroyed because it depends on the subjective judgment of the IT person in charge. Therefore, in this paper, we propose a model and algorithm for identifying the referenced table based on SQL executed in the computer program, analyzing the upper relation between tables with the primary key information of the table, and visualizing and objectively selecting the range to be destroyed. presented and implemented.

Comparison of Remaining Data According to Deletion Events on Microsoft SQL Server (Microsoft SQL Server 삭제 이벤트의 데이터 잔존 비교)

  • Shin, Jiho
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.27 no.2
    • /
    • pp.223-232
    • /
    • 2017
  • Previous research on data recovery in Microsoft SQL Server has focused on restoring data based on in the transaction log that might have deleted records exist. However, there was a limit that was not applicable if the related transaction log did not exist or the physical database file was not connected to Server. Since the suspect in the crime scene may delete the data records using a different deletion statements besides "delete", we need to check the remaining data and a recovery possibility of the deleted record. In this paper, we examined the changes "Page Allocation information" of the table, "Unallocation deleted data", "Row Offset Array" in the page according to "delete", "truncate" and "drop" events. Finally it confirmed the possibility of data recovery and availability of management tools in Microsoft SQL Server digital forensic investigation.