• KIISE Transactions on Computing Practices
• /
• v.21 no.8
• /
• pp.537-542
• /
• 2015

Database Shard is a technique that can be queried and stored by dividing one logical table into multiple databases horizontally. In order to analyze the shard data with aggregate or analysis functions, a process is required that integrates partial results on each shard database. In this paper, we introduce the design and implementation of a distributed processing system for aggregation and analysis on the CUBRID Shard distributed database, which is an open source database management system. The implemented system can accelerate the analysis onto multiple shards of partitioned tables; it shows efficient aggregation on shard distributed databases compared to stand-alone databases.

• The Korean Journal of Petroleum Geology
• /
• v.12 no.1
• /
• pp.9-13
• /
• 2006

Volcanic glass shard, which shows relatively homogeneous chemical composition in volcanic eruption materials, is used to determine ages of tephra layers and then to correlate tephra layers each other for understanding of evolution of Quaternary geomorphology. For reducing processing errors in age determination and correlation of units, amorphous glass shard should be separated carefully from soil sample through laboratory procedures such as washing, separation, and identification. Introduction of these processes in detail could be reduced errors in tephrochronology by using volcanic glass shard.

• Proceedings of the Korea Contents Association Conference
• /
• 2014.11a
• /
• pp.37-38
• /
• 2014

최근 SNS의 발전으로 인해 데이터의 양이 급격히 증가하였으며, 이에 따라 빅데이터 처리를 위한 분산 DBMS 기반 질의 처리 연구가 활발히 진행되고 있다. 이를 위해 CUBRID는 CUBRID Shard 서비스를 통해 데이터베이스를 shard 단위로 수평 분할하여 각기 다른 물리 노드에 데이터를 분산 저장하도록 지원한다. 그러나 CUBRID Shard는 shard간 데이터가 독립적으로 관리되기 때문에 세타 조인 및 중첩 질의와 같이 다수 서버에서의 테이블 참조가 필요한 질의는 처리가 불가능하다. 따라서 본 논문에서는 분산 CUBRID 상에서 세타 조인 및 중첩 SQL를 지원하는 질의 재구성 기법을 제안한다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.11
• /
• pp.453-462
• /
• 2017

OpenDaylight is an SDN (Software Defined Networking) open source framework, which is popular in network fields recently. This paper analyzes the performance of a controller cluster architecture by focusing on distributed datastore and Raft leader election algorithm. In addition, we propose an enhanced version of Raft algorithm in order to improve the performance of distributed datastore by distributing shard leaders over controller cluster. This paper compares the conventional Raft algorithm with the proposed version of the Raft algorithm. Moreover, we compare the performance of distributed datastore according to shard roles such as leader and follower. Experimental results show that Shard leaders provide better performance than followers and Shard updating requests need to be distributed over multiple controllers. So, by using proposed version of Raft algorithm, controller performance can be improved. The details of the experiment results are cleary described.

• Journal of Information Processing Systems
• /
• v.13 no.3
• /
• pp.518-532
• /
• 2017

Due to the rapid growth of the amount of data, research on bigdata processing has been highlighted. For bigdata processing, CUBRID Shard is able to support query processing in parallel way by dividing the database into a number of CUBRID servers. However, CUBRID Shard can answer a user's query only when the query is required to gain accesses to a single CUBRID server, instead of multiple ones. To solve the problem, in this paper we propose a CUBRID based distributed parallel query processing system that can answer a user's query in parallel and distributed manner. Finally, through the performance evaluation, we show that our proposed system provides 2-3 times better performance on query processing time than the existing CUBRID Shard.

• The Journal of the Petrological Society of Korea
• /
• v.16 no.2 s.48
• /
• pp.73-81
• /
• 2007

A basaltic tuff formation (Upper Basaltic Tuff of the Janggi Group) occurs in close association with basalt (Yeonil Basalt) at the Tertiary Janggi basin. The purpose of this paper is to describe the occurrence of the basaltic tuff and associated basalt and to determine their mode of formation. The basaltic rocks of the study area show few distinct lithofacies, all of which are originated from the interaction of basaltic magma with external water. The four lithofacies include (1) sideromelane shard hyaloclastite, (2) pillow breccia, (3) entablature-jointed basalt, and (4) in-situ breccia. The sideromelane shard hyaloclastite constitutes most of the Upper Basaltic Tuff and has a gradual contact with the pillow breccia. The pillow breccia consists of a poorly sorted mixture of isolated and broken pillows, and small basalt globules and fragments engulfed in a volcanic matrix of sideromelane shard hyaloclastite. The entablature-jointed basalt occurs as a small body within the hyaloclastite. It is characterized by irregularly-curved joints known as entablature. The in-situ breccia occurs as a marginal facies of entablature-jointed basalt, and its width varies from 10 to 30m. The result of this study indicates that the basaltic tuff and associated basalts of the study area were produced by the volcanic activity of same period and the basaltic tuff was formed by subaqueous eruption of basaltic lava followed by nonexplosive quench fragmentation.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.4
• /
• pp.93-100
• /
• 2021

The Ethereum shard system for solving the scalability problem of the blockchain has a load balancing issue, which is modeled as a graph partitioning problem. In this paper, we propose an adaptive online weighted graph partitioning algorithm that can negotiate between two utility of the shard system using the game theory's bargaining solution. The bargaining solution is an axiomatic solution that can fairly determine the points of conflict of utility. The proposed algorithm was improved to apply the existing online graph partitioning algorithm to the weighted graph, and load balancing was performed efficiently through the design considering the situation of the sharding system using the extension of Nash bargaining solution, which is extended to apply solution to non-convex feasible set of bargaining problem. As a result of the experiment, it showed up to 37% better performance than typical load balancing algorithm of shard system.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.714-717
• /
• 2014

최근 SNS의 발전으로 인해 정보의 양이 급격히 증가하였으며, 이에 따라 빅데이터 처리를 위한 NoSQL에 대한 연구가 활발히 진행되고 있다. 그러나 NoSQL은 데이터베이스의 ACID 조건을 만족하지 못하는 문제점이 존재한다. 따라서 RDBMS를 기반으로 빅데이터 처리를 수행하는 연구가 활발히 진행되고 있다. 이를 위한 대표적인 기법인 CUBRID Shard는 데이터베이스를 Shard 단위로 수평 분할하여 각기 다른 물리 노드에 데이터를 분산 저장한다. 그러나 해당 기법은 한 클라이언트의 질의가 다수의 서버에서 실행되어야 하는 경우를 에는 질의를 처리하지 못하는 단점을 보인다. 따라서 본 논문에서는 병렬 질의 처리를 지원하는 CUBRID 기반 분산 미들웨어를 제안한다.

• Conservation Science in Museum
• /
• v.22
• /
• pp.85-96
• /
• 2019

The restoration of ceramics excavated in fragments is limited by the difficulty of inferring the overall shape of the original object. However, recent innovations in digital technology can help to overcome the limits of conventional restoration using handwork. This study explored the potential of digital technology by digitally restoring a shard from a white porcelain water dropper excavated at a kiln site at Sindae-ri. In order to complete the digital restoration, 3D scanning was applied to obtain scan data, and 3D modeling and texture mapping were performed. In this way, three-dimensional data with patterns and color information was acquired and the original form of the water dropper could be ascertained based on the shard. The study found that the data acquired from digital restoration can be used for various purposes, including for obtaining data on cross-sections or missing portions of a relic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.12
• /
• pp.1801-1810
• /
• 2016

The OpenDaylight controller has been receiving significant attention as one of the enabling open source framework for SDN, and this paper analyzes the architecture and procedure of OpenDaylight based controller cluster. The OpenDaylight controller cluster uses shard based distributed datastore and Raft algorithm to maintain consistency among controllers inside a cluster. The performance evaluation analyzes the leader re-election time as well as latencies of CRUD and Routed RPC according to cluster size, shard role, and sharding strategy, and we discuss the optimal operation strategy for OpenDaylight controller cluster.