• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.613-620
• /
• 2003

The RPC Is one of the most used communication mechanisms in the distributed system. This study Is to design the simple interface for making use of database under the distributed environments by using XML-RPC among the RPC protocols. The access to any database of the current RDB programs is needed for a programming format of the special API according to the programming language, fiat form and the class of the used database but simplification of database access shows that various different database accesses and manipulation are easier and more convenient in the special computer languages and environments by the middleware implemented using a XML-RPC protocol.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.795-798
• /
• 1999

To transmit multimedia information efficiently and use it in realtime, it needs a private multimedia terminal for service type. But multimedia information terminal was developped for of offered service type in case by case. Accordingly, general multimedia terminal have not been developed yet. Multimedia database structure and standard communication protocol must be designed first to develop the general multimedia terminal. Multimedia database structure needs to store the various multimedia information consistently and, standard communication protocol access the database transparently. In this paper, we design a multimedia database structure and communication protocol that are able to access the multimedia information on distributed database servers in the network.

• KIISE Transactions on Computing Practices
• /
• v.24 no.3
• /
• pp.105-112
• /
• 2018

As data size increase, a single database is not enough to serve current volume of tasks. Since data is partitioned and stored into multiple databases, analysis should also support parallelism in order to increase efficiency. However, traditional analysis requires data to be transferred out of database into nodes where analytic service is performed and user is required to know both database and analytic framework. In this paper, we propose an efficient way to perform K-means clustering algorithm inside the distributed column-based database and relational database. We also suggest an efficient way to optimize K-means algorithm within relational database.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.11
• /
• pp.57-63
• /
• 2017

The recent sudden increase of big data has characteristics such as continuous generation of data, large amount, and unstructured format. The existing relational database technologies are inadequate to handle such big data due to the limited processing speed and the significant storage expansion cost. Thus, big data processing technologies, which are normally based on distributed file systems, distributed database management, and parallel processing technologies, have arisen as a core technology to implement big data repositories. In this paper, we propose a design methodology for large-scale database based on MongoDB by extending the information engineering methodology based on E-R data model.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.9
• /
• pp.2797-2806
• /
• 2000

Recently, DDSs(Distributed Database Systems) have been implemented on V AN(V alue Added Network) as we know the amazing expansion of information network. DDS can yield significant cost and response time advantages over centralized systems for geographically distributed organizations. However, inappropriate design can result in high cost and poor response time to maintain the database at each site. In a DDS design, the main problem is how to select proper computer and how to allocate data fragment into a proper site. In this paper, we address DDS design problem of selecting the proper class of computers and the allocating data files on VAN. Also, the formulated model includes two objectives, the waited response time and the investment cost to include their relationship. Specially, the formulation of waited response time is based on M/M/1 queueing system to evaluate more precisely. GA(Genetic Algorithm), a kind of heuristic search method, is developed to search an optimal solution in the proposed design model and we show the simulation result to examine the algorithm performance.

• Korean Journal of Computational Design and Engineering
• /
• v.7 no.1
• /
• pp.66-73
• /
• 2002

The purpose of this study is to propose a new process model for architects and suppliers in AEC(Architectural, Engineering and Construction) industry, which comes from its utilization of a distributed database. Information used by participants of this process is not held in one singular application sewer, but in tile databases of multiple participants. This study addresses the problem of coping with dynamic information changes that architects face when designing with increasingly time-sensitive product information from multiple suppliers. It also describes the new distributed architecture for design representation, and outlines a corresponding process model to address the needs architectural designers during design and procurement phases. The feasibility of the process was tested in a prototype system that combines existing technologies, which allows for an objects transfer from the Web to the CAD application.

• ETRI Journal
• /
• v.22 no.1
• /
• pp.1-11
• /
• 2000

The Satellite Operation System (SOS) has been developed for a low earth orbiting remote sensing satellite, Korea Multipurpose Satellite-I, to monitor and control the spacecraft as well as to perform the mission operation. SOS was designed to operate on UNIX in the HP workstations. In the design of SOS, flexibility, reliability, expandability and interoperability were the main objectives. In order to achieve these objectives, a CASE tool, a database management system, consultative committee for space data systems recommendation, and a real-time distributed processing middle-ware have been integrated into the system. A database driven structure was adopted as the baseline architecture for a generic machine-independent, mission specific database. Also a logical address based inter-process communication scheme was introduced for a distributed allocation of the network resources. Specifically, a hotstandby redundancy scheme was highlighted in the design seeking for higher system reliability and uninterrupted service required in a real-time fashion during the satellite passes. Through various tests, SOS had been verified its functional, performance, and inter-face requirements. Design, implementation, and testing of the SOS for KOMPSAT-I is presented in this paper.

• Journal of Biomedical Engineering Research
• /
• v.9 no.2
• /
• pp.195-210
• /
• 1988

We build up distributed database of medical picture and design and realize H/W & S/W of special image workstation. We build up high speed image transmission system for distributed database and retrieval of various medical pictures in w ard through image transmission system and realize integrated image diagnosis. This system improves medical service by speedy diagnosis and enables more precise diagnosis by integrated image diagnosis through distributed database. In economical view this system curtails huge cost of film processing and transmission, which make medical expense cheaf, because it does not use film. We built up PACS in pediatric hospital of Seoul National University Hopital and tested the system with various medical pictures and showed that speedy integrated image diagnosis is possible.

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

• Asia pacific journal of information systems
• /
• v.6 no.1
• /
• pp.165-194
• /
• 1996

Data distribution is one of the most important steps in distributed database design. This paper proposes a methodology for distributing database by using a relational schema as an input. A design support system called DBDD (Database Distribution Design) is implemented within the framework of this methodology. The methodology consists of three phases such as (i) schema analysis, (ii) fragmentation, and (iii) allocation. In the schema analysis phase, all the table names are acquired from a global relational schema. In the fragmentation phase, fragments are generated according to transaction retrieval patterns. Furthermore, DBDD enhances the design quality by allocating fragments in a progressive manner. A real-life case is illustrated to demonstrate the practical usefulness of the DBDD.