• 한국콘텐츠학회논문지
• /
• 제10권4호
• /
• pp.84-90
• /
• 2010

데이터베이스 시스템의 응용분야가 데이터웨어하우징에서 전자상거래에 이르기까지 광범위해지면서 데이터베이스 시스템이 대형화되었다. 이로 인해 데이터베이스 시스템의 성능 향상을 위한 튜닝이 중요한 논점이 되었다. 데이터베이스 시스템의 튜닝은 워크로드 특성을 고려하여 수행할 필요가 있다. 그러나 복합적인 데이터베이스 환경에서 워크로드를 식별하기는 어려우므로 자동적인 식별 방법이 요구된다. 본 논문에서는 데이터베이스 워크로드를 자동적으로 식별하는 SVM 워크로드 분류기를 제안한다. TPC-C와 TPC-W 성능 평가에서 자원할당 파라미터 변경에 따른 워크로드 데이터를 수집하여 SVM을 통해 분류 한다. SVM의 커널별 커널 파라미터와 오류 허용 임계치 값인 C의 조정을 통하여 최적의 SVM 워크로드 분류기를 선택한다. 제안한 SVM 워크로드 분류기와 Decision Tree, Naive Bayes, Multilayer Perceptron, K-NN 분류기의 분류 성능을 비교한 결과, SVM 워크로드 분류기가 다른 기계 학습 분류기보다 9% 이상 향상된 분류 성능을 보였다.

• 산업공학
• /
• 제9권3호
• /
• pp.257-268
• /
• 1996

This paper illustrates the process of developing and configuring the prototype Computer Analysis System for Controlling Occupational WORKload (CAS-COWORK). The software interface between the database and expert system was attempted. The database is used for storing and retrieving series of data entered by general users and the expert system is used for identifying and solving occupational problem areas. Two theories were applied in developing the algorithm base of CAS-COWORK that were used to calculate overall workload stress level. The fuzzy set theory was introduced to capture the subject‘s workload stress perception. The Analytic Hierarchy Process (AHP) was introduced to estimate the importance of the task and workplace variables. The purpose of the system development is for future prediction and problem solving which would be highly valuable to the industrial engineer.

• 정보처리학회논문지D
• /
• 제11D권7호
• /
• pp.1427-1434
• /
• 2004

데이터베이스 시스템 벤치마크는 결과 값의 극대화를 위해 실험 대상 시스템의 가용 자원을 최대화한 상태에서 수행되어 실세계 환경과는 괴리된다는 한계성을 가지고 있다. 실세계에서의 작업 환경과 유사한 환경에서의 벤치마크 시험을 위해 본 논문에서는 기존 벤치마크를 보완할 수 있는 실세계 부하 생성 도구를 제안한다. 본 부하 생성 도구는 시스템의 메모리, 디스크, CPU를 활용하여 운영체제에 직접적인 부하를 생성하며, 실세계 부하와 유사한 통합 부하 ktod성을 지원한다. 본 논문에서는 각 부하 생성 방식, 개발된 부하 생성 도구의 구조, 특징, 구현 방법 등을 기술하였다. 또한 위스콘신 벤치마크를 TPC-C 벤치마크 및 부하 생성 도구와 함께 수행하여 두 성능 평가 실험 결과를 비교하고, 이를 통해 제안하는 부하 생성 도구의 적절성을 보였다.

• 한국산업정보학회논문지
• /
• 제15권5호
• /
• pp.97-104
• /
• 2010

본 논문에서는 그리드 데이터베이스에서의 부하 분산 문제를 복제 데이터 간 메쉬 연결 구조를 이용하여 해결한다. 그리드 데이터베이스의 데이터는 성능 향상을 위해 여러 노드에 복제 저장되어 있다. 따라서 사용자 질의는 목적 데이터를 포함하는 노드들의 작업 부하를 평가하여 노드를 선택함으로써 구성 노드들 간의 부하를 분산하여야 한다. 기존의 기법은 노드의 작업 부하가 한계를 넘게 되었을 때 다른 연결 노드를 선택하여 질의를 처리하게 하는 수동적 부하 분산 기법을 사용하기 때문에 노드의 수가 많고 질의가 유동적인 그리드 데이터베이스에 적용하기에는 비효율적이다. 제안 기법은 각각의 동일 복제본이 포함된 노드들을 하나의 메쉬 구조로 연결하여 사용자 질의가 발생하였을 때 연결 노드 중 부하가 가장 적은 노드를 선택하여 질의 처리를 할 수 있도록 한다. 제안 기법은 성능 평가를 통해 기존의 기법보다 향상된 성능을 가짐을 보였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권4호
• /
• pp.1693-1713
• /
• 2018

An important technique used by database administrators (DBAs) is to improve performance in decision-support workloads associated with a Star schema is multi-level partitioning. Queries will then benefit from performance improvements via partition elimination, due to constraints on queries expressed on the dimension tables. As the task of multi-level partitioning can be overwhelming for a DBA we are proposing a wizard that facilitates the task by calculating a partitioning scheme for a particular workload. The system resides completely on a client and interacts with the costing estimation subsystem of the query optimizer via an API over the network, thereby eliminating any need to make changes to the optimizer. In addition, since only cost estimates are needed the wizard overhead is very low. By using a greedy algorithm for search space enumeration over the query predicates in the workload the wizard is efficient with worst-case polynomial complexity. The technology proposed can be applied to any clustering or partitioning scheme in any database management system that provides an interface to the query optimizer. Applied to the Teradata database the technology provides recommendations that outperform a human expert's solution as measured by the total execution time of the workload. We also demonstrate the scalability of our approach when the fact table (and workload) size increases.

• Journal of Information Technology Applications and Management
• /
• 제15권1호
• /
• pp.271-282
• /
• 2008

Database administrators are demanded to acquire much knowledges and take great efforts for keeping consistent performance in system. Various principles, methods, and tools have been proposed in many studies and commercial products in order to alleviate such burdens on database administrators, and it has resulted to the automation of DBMS which reduces the intervention of database administrator. This paper suggests a resource selection method that estimates the status of the database system based on the workload characteristics and that recommends tuneable resources. Our method tries to simplify selection information on DBMS status using data-mining techniques, enhance the accuracy of the selection model, and recommend tuneable resource. For evaluating the performance of our method, instances are collected in TPC-C and TPC-W workloads, and accuracy are calculated using 10 cross validation method, comparisons are made between our scheme and the method which uses only the classification procedure without any simplification of informations. It is shown that our method has over 90% accuracy and can perform tuneable resource selection.

• Journal of Information Technology Applications and Management
• /
• 제9권1호
• /
• pp.27-44
• /
• 2002

Performance evaluations of database algorithms are usually conducted on a set of queries for a given test database. For more detailed evaluation results, it is often necessary to use different query workloads several times. Each query workload should reflect the querying patterns of the application domain in real world, which are non-uniform in the usage frequencies of attributes in queries of the workload for a given database. It is not trivial to generate many different query workloads manually, while considering non-uniform distributions of attributes'usage frequencies. In this paper we propose a technique to generate non-uniform distributions, which will help construct query workloads more efficiently. The proposed algorithm generates a query-attribute usage distribution based on given constraints on usage frequencies of attributes and qreries. The algorithm first allocates as many attributes to queries as Possible. Then it corrects the distribution by considering attributes and queries which are not within the given frequency constraints. We have implemented and tested the performance of the proposed algorithm, and found that the algorithm works well for various input constraints. The result of this work could be extended to help automatically generate SQL queries for various database performance benchmarking.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권7호
• /
• pp.3533-3549
• /
• 2019

A big database utilizes the establishing network technology, and it became an emerging trend in the computing field. Therefore, there is a necessity for an optimal and effective data distribution approach to deal with this trend. This research presents the practical perspective of designing and implementing distributed database features. The proposed system has been establishing the satisfying, reliable, scalable, and standardized use of information. Furthermore, the proposed scheme reduces the vast and recurring efforts for designing an individual system for each university, as well as it is effectively participating in solving the course equivalence problem. The empirical finding in this study shows the superiority of the distributed system performance based on the average response time and the average waiting time than the centralized system. The system throughput also overcomes the centralized system because of data distribution and replication. Therefore, the analyzed data shows that the centralized system thrashes when the workload exceeds 60%, while the distributed system becomes thrashes after 81% workload.

• 대한인간공학회:학술대회논문집
• /
• 대한인간공학회 1996년도 추계학술대회논문집
• /
• pp.47-55
• /
• 1996

This study developed a comprehensive and easily applicable nuclear reactor control system evaluation method using reactor operators behavioral and mental workload database. A proposed control panel design cycle consists of the 5 steps: (1) finding out inconvenient, erroneous, and mentally stressful factors for the proposed design through evaluative experiments, (2) drafting improved design alternatives considering detective factors found out in the step (1), (3) comparative experiements for the design alternatives, (4) selecting a best design alternative, (5) returning to the step (1) and repeating the design cycle. Reactor operators behavioral and mental workload database collected from evaluative experiments in the step (1) and comparative experiments in the step (3) of the design cycle have a key roll in finding out defective factors and yielding the criteria for selection of the proposed reactor control systems. The behavioral database was designed to include the major informations about reactor operators' control behaviors: beginning time of operations, involved displays, classification of observational behaviors, dehaviors, decisions, involved control devices, classification of control behaviors, communications, emotional status, opinions for man-machine interface, and system event log. The database for mental workload scored from various physiological variables-EEG, EOG, ECG, and respir- ation pattern-was developed to indicate the most stressful situation during reactor control operations and to give hints for defective design factors. An experimental test for the evaluation method applied to the Compact Nuclear Simulator (CNS) installed in Korea Atomic Energy Research Institute (KAERI) suggested that some defective design factors of analog indicators should be improved and that automatization of power control to a target level would give relaxation to the subject operators in stressful situation.

• 산업경영시스템학회지
• /
• 제24권64호
• /
• pp.1-20
• /
• 2001

In distributed databases, file replication and workload allocation are important design issues. This paper solves these two issues simultaneously, The primary objective is to minimize the system response time that consists of local processing and communication overhead on a local area network. Workload (query transactions) is assigned among any sites in proportion to the remaining file request service rate of the each server The problem is presented in the form of a nonlinear integer programming model. The problem is proved to be NP-complete and thus an efficient heuristic is developed by employing its special structure. To illustrate its effectiveness, it is shown that the proposed heuristic is based on the heuristic of a non-redundant allocation that was provided to be effective. The model and heuristics are likely to provide more effective distributed database designs.