• Title/Summary/Keyword: OLTP

Search Result 49, Processing Time 0.021 seconds

트랜잭션 프로세싱의 현재와 미래

  • Korea Database Promotion Center
    • Digital Contents
    • /
    • no.3 s.58
    • /
    • pp.38-45
    • /
    • 1998
  • 지난 수년간 온라인 트랜잭션 프로세싱은 지속적으로 사용자들의 관심을 유발시켜 왔다. 그러나 아직까지도 진정한 OLTP 시스템 전문가를 찾기는 쉽지 않은 실정이며, 그 개념에 대해서도 이견이 분분하다. 또한 최근에는 OLTP 시스템을 데이터웨어하우스와 접목. 그 기능을 재정의하는 논의도 재개되고 있다. 성공적인 OLTP 시스템 구축 요령과 향후의 OLTP의 미래에 대해 전망해본다.

  • PDF

Face Representation and Face Recognition using Optimized Local Ternary Patterns (OLTP)

  • Raja, G. Madasamy;Sadasivam, V.
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.1
    • /
    • pp.402-410
    • /
    • 2017
  • For many years, researchers in face description area have been representing and recognizing faces based on different methods that include subspace discriminant analysis, statistical learning and non-statistics based approach etc. But still automatic face recognition remains an interesting but challenging problem. This paper presents a novel and efficient face image representation method based on Optimized Local Ternary Pattern (OLTP) texture features. The face image is divided into several regions from which the OLTP texture feature distributions are extracted and concatenated into a feature vector that can act as face descriptor. The recognition is performed using nearest neighbor classification method with Chi-square distance as a similarity measure. Extensive experimental results on Yale B, ORL and AR face databases show that OLTP consistently performs much better than other well recognized texture models for face recognition.

A Study on Efficient Management of RAID Level 5 Cache in OLTP Environment under Linux Operating System (리눅스 운영체제하의 OLTP환경에서 RAID 레벨 5의 효율적인 캐쉬 운영 방안에 대한 연구)

  • 송자영;장태무
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.3-5
    • /
    • 2000
  • RAID 레벨 5는 쓰기 시에 패리티 갱신을 위한 4번의 디스크 접근으로 인하여 OLTP와 같이 상대적으로 빈번한 디스크 접근을 가지고 데이터 크기가 작으며 쓰기의 횟수가 많은 작업환경에서 성능이 떨어지게 된다. 데이터와 패리티에 대한 캐싱은 OLTP환경에서의 쓰기에 대한 문제를 해결하기 위한 기법이다. 본 논문에서는 리눅스 운영체제의 파일 데이터 구조에 변화를 주고, 커널에서 얻어진 정보를 디스크 캐쉬의 운영에 이용한다. 스트라입 크기(G)를 가지는 RAID 레벌 5에서 패리티 캐쉬의 크기가 전체 캐쉬 크기의 1/G 이하 일 경우 데이터 패리티 캐쉬 크기 변화에 영향을 받지 않고 캐쉬의 그룹 단위 운영과 그에 따른 패리티의 미리 읽기를 가능하게 하여 패리티에 대한 추가적인 읽기를 최소화하는 기법을 제안한다. 본 논문의 실험 결과는 초당 디스크에 도착하는 평균 디스크 접근 요구 개수에 변화를 주어 시뮬레이션 방법으로 입증하였으며, OLTP 환경에서 데이터와 패리티 캐쉬를 독립적으로 운영하는 일반적인 캐쉬 운영 방법에 비해 평균 응답시간을 단축시킬 수 있음을 알 수 있다.

  • PDF

- A Study on Development of OLTP System for Supporting the ERP System - (ERP 시스템 지원을 위한 OLTP 시스템 개발에 관한 연구)

  • 양광모;한영근;강경식
    • Journal of the Korea Safety Management & Science
    • /
    • v.5 no.2
    • /
    • pp.145-154
    • /
    • 2003
  • Recently, many companies want to accept and operate ERP (Enterprise Resource Planning) system in their fields ERP does not only include business, but also include finance, account, trade, personnel and BPR(Business Process Reengineering). Especially, it is necessary to have ERP system for companies which have lots of external business such as trade and communication sector. And then, in this paper, I will think about OLTP (On-Line Transaction Processing) system for operating ERP system and improve its defects that can operate more effective sales, circulation, demand plan. But it is regrettable that I can not make a comparative analysis with other systems because the ERP system is still on the introductory stage for the company studies and the benefits have not been realized yet. Another limitation of this research is its narrow scope of study in which only the raw material inventory system for a single company is covered. In the future, however, ERP system would be adopted by many corporations, which would help us to launch a comparative study on the results of ERP system implementation as a future direction of research.

A Study of the Benchmarks for OLTP Server's Performance Measurement and Sizing (OLTP서버 성능측정 및 규모산정을 위한 벤치마크 기준에 대한 고찰)

  • Ra, Jong-Hei;Choi, Kwang-Don
    • Journal of Digital Convergence
    • /
    • v.7 no.3
    • /
    • pp.25-33
    • /
    • 2009
  • Historically, performance prediction and sizing of server systems have been the key purchasing argument for customer. To accurate server's sizing and performance prediction, it is necessary to correctness guideline for sizing and performance prediction. But existing guidelines have many errors. So, we examine the benchmarks of performance organization such as SPEC and TPC. And then we consider to TPC-C and TPC-E benchmarks for OLTP server's sizing and performance prediction that is a basic concept of guidelines. Eventually, we propose improvement of errors in guidelines.

  • PDF

A Study on Improvement of OLTP Server Sizing Method (OLTP서버 규모산정방식의 개선에 관한 연구)

  • Ra, Jong-Hei;Choi, Kwang-Don
    • Journal of Information Technology Services
    • /
    • v.8 no.3
    • /
    • pp.185-195
    • /
    • 2009
  • Hardware sizing is determinated by an increasing rate of operated business and characteristic of adapted technology which are imported systems. Because it is very difficult for intuitive decision of hardware sizing's appropriateness. But in sprite of difficulty, for maximizing the utilization of information resource and the effect of information investment in public sector are need to correctness hardware sizing. In this paper, we proposed hardware sizing method for OLTP server that is make up It's faults of proper proposal method. Our study certainly will act as a catalyst for higher investment-efficiency of future information systems in public sector.

Hash Join Performance on Flash SSD in OLTP Environment (OLTP 환경에서의 플래시 SSD 기반 해시 조인 성능에 대한 고찰)

  • Koo, Dong-Hyun;Sim, Jun-Hyeon;Kim, Kang-Nyeon;Lee, Sang-Won
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.04a
    • /
    • pp.1291-1293
    • /
    • 2011
  • OLTP(online transaction processing) 환경은 다수의 사용자의 질의 및 요청을 처리하기 위한 데이터베이스 환경으로서 신속하고 정확한 질의 처리가 요구된다. 조인 연산은 이러한 데이터베이스 관리 시스템에서 자주 처리하게 되는 질의 가운데 하나이며, 그 중에서도 해시 조인은 현재 가장 좋은 성능을 보인다고 알려진 조인 알고리즘이다. 이 논문에서는 직접 해시 조인을 구현하여 읽기 및 쓰기 버퍼의 크기가 제한되었을 때 SSD와 하드디스크에서 해시 조인의 성능을 비교하고, 나아가 다수의 사용자가 동시에 여러 개의 조인 연산을 요청했을 때의 상황을 시뮬레이션 하여 SSD에서의 최적화 방안을 생각해본다.

HIPSS : A RAID System for SPAX (HIPSS : SPAX(주전산기 IV) RAID시스템)

  • 이상민;안대영;김중배;김진표;이해동
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.35C no.6
    • /
    • pp.9-19
    • /
    • 1998
  • RAID technology that provides the disk I/O system with high performance and high availability is essential for OLTP server. This paper describes the design and implementation of the HIPSS RAID system that has been developed for the SPAX OLTP server. HIPSS has the following design objectives: high performance, high availability, standardization and modularization of external interface, and ease of maintenance. It guarantees high performance by providing 10 independent I/O channels, large data cache, and parity calculation engine. Hardware modularization of the host interface makes it easy to replace host interface hardware module. By providing dual power supply, dual array controller, and disk hot swapping, it provides the system with high availability Implementation of HIPSS and integration test on SPAX has been completed and performance measurement on HIPSS is now going on. In this paper, we provide the detail description for HIPSS system architecture and the implementation results.

  • PDF

A Selective Compression Strategy for Performance Improvement of Database Compression (데이터베이스 압축 성능 향상을 위한 선택적 압축 전략)

  • Lee, Ki-Hoon
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.4 no.9
    • /
    • pp.371-376
    • /
    • 2015
  • The Internet of Things (IoT) significantly increases the amount of data. Database compression is important for big data because it can reduce costs for storage systems and save I/O bandwidth. However, it could show low performance for write-intensive workloads such as OLTP due to the updates of compressed pages. In this paper, we present practical guidelines for the performance improvement of database compression. Especially, we propose the SELECTIVE strategy, which compresses only tables whose space savings are close to the expected space savings calculated by the compressed page size. Experimental results using the TPC-C benchmark and MySQL show that the strategy can achieve 1.1 times better performance than the uncompressed counterpart with 17.3% space savings.