• Title/Summary/Keyword: 데이터베이스 워크로드

Search Result 15, Processing Time 0.026 seconds

A Modified Fuzzy k-NN Algorithm for Identifying Database Workloads (데이터베이스 워크로드 식별을 위한 수정된 퍼지 k-NN 알고리즘)

  • Oh, Jeong-Seok;Lee, Sang-Ho
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11b
    • /
    • pp.70-72
    • /
    • 2005
  • 데이터베이스 관리자는 효과적인 데이터베이스 관리를 위해 워크로드 특성을 잘 알아야 한다. 워크로드 특성은 데이터베이스 응용분야에 따라 다르며, 데이터베이스 환경에서 하나 이상의 응용 분야가 수행될 수 있다. 복합적인 데이터베이스 응용 분야 때문에, 관리자가 데이터베이스 시스템에서 발생하는 워크로드를 식별하기가 더욱 어려워졌다. 복합적인 데이터베이스 응용 분야의 효과적인 데이터베이스 관리를 수행하기 위해 워크로드를 식별할 수 있는 방법이 요구된다. 이를 위해, 본 연구는 TPC-C와 TPC-W 성능평가의 워크로드와 두 성능평가의 혼합된 워크로드들을 생성하여 워크로드 식별을 수행하였다. 워크로드 식별은 퍼지 k-NN 알고리즘을 수정하여 진행하였다. 수정된 k-NN 알고리즘은 혼합 비율에 따라 시험 워크로드 데이터와 훈련 워크로드 데이터간의 워크로드 식별 실험에 사용되었고, 분류를 위한 k-NN, 퍼지 k-NN, 분산 가중치 퍼지 k-NN 알고리즘의 결과와 비교되었다. 수정된 k-NN 알고리즘은 다른 알고리즘보다 k 인자에 따른 변동과 오차율이 감소하여 워크로드 식별에 더 적합함을 보였다. 본 논문의 결과는 복합된 데이터베이스 응용 분야의 특성을 보이는 데이터베이스 환경에서 워크로드 식별 정보를 창조하여 융통성 있는 튜닝 기법을 고려하는데 기여한다.

  • PDF

Automatic Identification of Database Workloads by using SVM Workload Classifier (SVM 워크로드 분류기를 통한 자동화된 데이터베이스 워크로드 식별)

  • Kim, So-Yeon;Roh, Hong-Chan;Park, Sang-Hyun
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.4
    • /
    • pp.84-90
    • /
    • 2010
  • DBMS is used for a range of applications from data warehousing through on-line transaction processing. As a result of this demand, DBMS has continued to grow in terms of its size. This growth invokes the most important issue of manually tuning the performance of DBMS. The DBMS tuning should be adaptive to the type of the workload put upon it. But, identifying workloads in mixed database applications might be quite difficult. Therefore, a method is necessary for identifying workloads in the mixed database environment. In this paper, we propose a SVM workload classifier to automatically identify a DBMS workload. Database workloads are collected in TPC-C and TPC-W benchmark while changing the resource parameters. Parameters for SVM workload classifier, C and kernel parameter, were chosen experimentally. The experiments revealed that the accuracy of the proposed SVM workload classifier is about 9% higher than that of Decision tree, Naive Bayes, Multilayer perceptron and K-NN classifier.

Resource Identification in Database Workloads (데이터베이스 워크로드에서의 자원 식별)

  • Oh Jeong-Seok;Lee Sang-Ho
    • The KIPS Transactions:PartD
    • /
    • v.13D no.2 s.105
    • /
    • pp.183-190
    • /
    • 2006
  • Database workloads may show different resource usages for database applications. Database administrators can enhance the DBMS performances through resource management that reflects workload characteristics. We provide a method that can identify tunable resources from analyzing the relationship between performance indicators and resources. First, we select which performance indicators increase or decrease by expanding resources using a correlation coefficient and a significance level test. Next, we identify resources that can affect the DBMS Performances by using increasing or decreasing performance indicators. We evaluated our method in the TPC-C and TPC-W environments.

Database Workload Analysis Based on Table Relationships (테이블 연관관계 도출을 통한 데이터베이스스 워크로드 분석)

  • Kim, Min-Su
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10c
    • /
    • pp.303-306
    • /
    • 2006
  • 데이터베이스 시스템을 효율적으로 운영하기 위하여 데이터베이스 관리자는 시스템의 자원 사용과 응용 프로그램에 의한 워크 로드의 특징을 알아야 한다. 워크 로드 분석을 위해 테이블, 리소스, 튜닝 방법론 등 여러 연구가 진행되어 왔으나 워크 로드를 형성하는 역할이 특정 테이블에만 집중되어 있는 현상에 대해서는 연구된 적이 없었다. 본 논문에서는 운영 시스템의 테이블 간의 연관 관계를 도출해 보고 연관 관계를 가지는 테이블 들이 워크 로드에 참여하는 유형과 횟수를 분석하는 워크 로드 분석 도구를 제안하고 대형 CRM 분석 시스템에 적용하여 데이터베이스 시스템의 워크로드를 분석해 본다.

  • PDF

A Design of Column-Group based Dynamic Page Storage Model for Mixed Workloads (혼합 워크로드 처리를 위한 컬럼 그룹 기반 동적 페이지 저장 관리 설계)

  • Park, Kyounghyun;Wonk, Hee Sun;Ryu, Keun Ho
    • Journal of Digital Contents Society
    • /
    • v.19 no.2
    • /
    • pp.335-341
    • /
    • 2018
  • There exists a limit in efficient processing of mixed workloads that database markets requires in recent years since existing database systems utilize a static page storage model. In this paper we propose a dynamic page storage model that can reflect the characteristics of mixed workloads. We also describe how to extract optimized column groups from given mixed workloads and how to construct pages dynamically. Finally, we show in our experiments that the proposed model is more efficient than the existing model in processing given mixed workloads.

Database Workload Analysis : An Empirical Study (데이타베이스 워크로드 분석 : 실험적 연구)

  • Oh, Jeong-Seok;Lee, Sang-Ho
    • The KIPS Transactions:PartD
    • /
    • v.11D no.4
    • /
    • pp.747-754
    • /
    • 2004
  • Database administrators should be aware of performance characteristics of database systems in order to manage database system effectively. The usages of system resources in database systems could be quite different under database workloads. The objective of this paper is to identify and analyze performance characteristics of database systems in different workloads, which could help database tuners tune database systems Under the TPC-C and TPC-W workloads, which represent typical workloads of online transaction processing and electronic commerce respectively, we investigated usage types of resource that are determined by fourteen performance indicator, and are behaved in response to changes of four tuning parameters (data buffer, private memory, I/O process, shared memory). Eight out of the fourteen performance indicators cleary show the performance differences under the workloads. Changes of data buffer parameter give a influences to database system. The tuning parameter that affects the system performance significantly is the database buffer size in the both workloads.

Analysis of Encryption Algorithm Performance by Workload in BigData Platform (빅데이터 플랫폼 환경에서의 워크로드별 암호화 알고리즘 성능 분석)

  • Lee, Sunju;Hur, Junbeom
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.29 no.6
    • /
    • pp.1305-1317
    • /
    • 2019
  • Although encryption for data protection is essential in the big data platform environment of public institutions and corporations, much performance verification studies on encryption algorithms considering actual big data workloads have not been conducted. In this paper, we analyzed the performance change of AES, ARIA, and 3DES for each of six workloads of big data by adding data and nodes in MongoDB environment. This enables us to identify the optimal block-based cryptographic algorithm for each workload in the big data platform environment, and test the performance of MongoDB by testing various workloads in data and node configurations using the NoSQL Database Benchmark (YCSB). We propose an optimized architecture that takes into account.

Design and Implementation of a Benchmarking System Based on ArangoDB (ArangoDB기반 벤치마킹 시스템 설계 및 구현)

  • Choi, Do-Jin;Baek, Yeon-Hee;Lee, So-Min;Kim, Yun-A;Kim, Nam-Young;Choi, Jae-Young;Lee, Hyeon-Byeong;Lim, Jong-Tae;Bok, Kyoung-Soo;Song, Seok-Il;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.21 no.9
    • /
    • pp.198-208
    • /
    • 2021
  • ArangoDB is a NoSQL database system that has been popularly utilized in many applications for storing large amounts of data. In order to apply a new NoSQL database system such as ArangoDB, to real work environments we need a benchmarking system that can evaluate its performance. In this paper, we design and implement a ArangoDB based benchmarking system that measures a kernel level performance well as an application level performance. We partially modify YCSB to measure the performance of a NoSQL database system in the cluster environment. We also define three real-world workload types by analyzing the existing materials. We prove the feasibility of the proposed system through the benchmarking of three workload types. We derive available workloads in ArangoDB and show that performance at the kernel layer as well as the application layer can be visualized through benchmarking of three workload types. It is expected that applicability and risk reviews will be possible through benchmarking of this system in environments that need to transfer data from the existing database engine to ArangoDB.

Storage Benchmarking System Using NoSQL Database Engines (NoSQL 데이터베이스 엔진을 이용한 스토리지 벤치마킹 시스템)

  • Choi, do-jin;Park, soo-bin;Park, song-hee;Baek, yeon-hee;Shin, bo-kyoung;Choi, jae-yong;Park, jae-yeol;Lim, jong-tae;Bok, kyoung-soo;Yoo, jae-soo
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2019.05a
    • /
    • pp.445-446
    • /
    • 2019
  • 빅데이터 시대의 도래로 다양한 NoSQL 데이터베이스 엔진이 활용되고 있다. NoSQL 데이터베이스 엔진 기반의 다양한 응용들이 수행될 때 스토리지의 성능을 평가하기 위한 스토리지 벤치마킹 툴이 요구된다. 본 논문에서는 NoSQL 데이터베이스를 이용한 스토리지 벤치마킹 시스템을 설계한다. 제안하는 스토리지 벤치마킹 시스템은 IO 추적기를 통해 스토리지의 성능을 측정하고, 웹 UI를 통해 사용자 정의 워크로드 생성, 벤치마킹 실행, 결과 확인을 수행할 수 있다.

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