• Journal of the Korea Institute of Building Construction
• /
• v.15 no.1
• /
• pp.107-113
• /
• 2015

Recently mechanization construction methods are developed rapidly in the field of construction processing. The construction industry is one of the sector that still requires a lot of manual labor of the entire industry. There are still various kinds of work done by human labors, especially in the disassembling and separation of materials for recycling. However, database of relevant statistics including estimating standards are difficult to analyze by actual human workload, and furthermore the disassembling processes are being analyzed by qualitative assessment. This study attempted to introduce the accelerometer for the quantitative evaluation of human workload in the construction field. Still, it is possible to calculate the amount of energy which is required for the assembling and disassembling of nail and screw through three-dimensional accelerometer.

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

• Journal of Internet Computing and Services
• /
• v.13 no.3
• /
• pp.83-91
• /
• 2012

Recently, column-oriented storage has become a progressive model for high-speed database systems because of its superior I/O performance. In this paper, we analysis traditional raw-oriented storage model and then propose a new column-aware storage management model using flash memory drive and assist drive to improve the effective performance of the high-speed column-oriented database system. Our storage management scheme called column-aware polarization improves the performance of update operation by dividing and compressing table columns into active-columns or inactive-columns, and balancing congested update operations using a assist drive in high workload periods. The results obtained from experimental tests show that our scheme improves the update throughput of column-oriented storage by 19 percent, and the response time by up to 49 percent.

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

• The Journal of the Korea Contents Association
• /
• v.21 no.12
• /
• pp.84-94
• /
• 2021

Graph databases have been developed to efficiently store and query graph data composed of vertices and edges to express relationships between objects. Since the query types of graph database show very different characteristics from traditional NoSQL databases, benchmarking tools suitable for graph databases to verify the performance of the graph database are needed. In this paper, we propose an efficient graph database benchmarking system that supports diversity in graph inputs and queries. The proposed system utilizes OrientDB to conduct benchmarking for graph databases. In order to support the diversity of input graphs and query graphs, we use LDBC that is an existing graph data generation tool. We demonstrate the feasibility and effectiveness of the proposed scheme through analysis of benchmarking results. As a result of performance evaluation, it has been shown that the proposed system can generate customizable synthetic graph data, and benchmarking can be performed based on the generated graph data.

• Journal of Korean Library and Information Science Society
• /
• v.39 no.2
• /
• pp.187-212
• /
• 2008

Many libraries and information centers offer various resources on their web sites and web reference is one of them. However, it can be quite burdensome for individual libraries to build a reliable database while sorting through countless web data. The attempts to build a collaborative database have been also unsuccessful due to heavy workload of librarians and financing problems. This study seeks to propose a UCC(User Created Contents)-based web reference database created by general users including librarians. It is an open reference database where everyone can contribute regardless of their affiliation and library types (for librarians), Also, it requires metadata scheme to standardize web-based references. By setting the initial metadata, it can present a basic guideline for users to post web references.

• Journal of KIISE:Databases
• /
• v.35 no.5
• /
• pp.400-410
• /
• 2008

Flash memory has been widely used in mobile devices, such as mobile phone and digital camera. Recently flash SSD(Solid State Disk), having same interface of the disk drive, is replacing the hard disk of some laptop computers. However, flash memory still cannot be considered as the storage of database systems. The FTL(Flash Translation Layer) of commercial flash SSD, making flash memory operate exactly same as a hard disk, shows poor performance on the workload of databases with many random overwrites. Recently In-Page Logging(IPL) approach was proposed to solve this problem. In this paper, we implement IPL approach on SQLite, a popular open source embedded DBMS, and evaluate its performance. It improves the performance by up to 30 factors for update queries.

• Proceedings of the IEEK Conference
• /
• 2003.07c
• /
• pp.2561-2564
• /
• 2003

Data mining is an effective method of the discovery of useful information such as rules and previously unknown patterns existing in large databases. The discovery of association rules is an important data mining problem. We have developed a new parallel mining called Distributed Frequent Pattern Tree (abbreviated by DFPT) algorithm on a distributed shared nothing parallel system to detect association rules. DFPT algorithm is devised for parallel execution of the FP-growth algorithm. It needs only two full disk data scanning of the database by eliminating the need for generating the candidate items. We have achieved good workload balancing throughout the mining process by distributing the work equally to all processors. We implemented the algorithm on a PC cluster system, and observed that the algorithm outperformed the Improved Count Distribution scheme.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.19-22
• /
• 2004

현대 사회에서 사용되는 많은 데이터베이스 시스템 벤치마크에서는 결과 값의 극대화를 위해 실험 대상 시스템의 가용 자원을 최대화한 상태에서 수행하는 문제점을 가지고 있다. 실세계에서의 작업 환경과 유사한 환경에서의 벤치마크 실험을 위해 본 논문에서는 기존 벤치마크를 보완할 수 있는 부하 생성기를 설계한다. 부하 생성기는 운영체제의 메모리와 디스크, CPU에 직접적인 부하를 생성하며, 실세계 부하와 유사하고 사용자들이 쉽게 조작 가능한 통합 부하 생성을 지원한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.71-72
• /
• 2013

최근 연구 개발되고 있는 스토리지 클래스 메모리는 정체되어 있는 스토리지와 DRAM 산업에 큰 변화를 가져올 것으로 예상된다. 현재 컴퓨팅 환경에서 스토리지의 성능 저하요소가 큰 이슈로 야기되어지는 가운데 본 논문에서는 TPC-C 벤치마크를 이용하여 임의 쓰기와 덮어 쓰기 연산 시 발생되는 문제점들을 분석한다. 실험 결과를 통해 향후 스토리지 클래스 메모리를 활용하여 기존 쓰기 연산 시 발행 하는 문제점들을 해결할 수 있는 방안에 대해 논의 한다.