• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
• /
• pp.87-91
• /
• 2004

This research presents distributed database and knowledge-base modeling approach for intelligent product design system. The product design information in this study is described by a collection of rules and design knowledge that are utilized according to the product development procedures. In this work, a network-based architecture has been developed to enable dispersed designers to simultaneously accomplish remote design tasks. A client/server communication diagram has also been proposed to facilitate consistent primary information modeling for multi-user access and reuse of designed results. An intelligent product design system has been studied with the concepts of distributed database and network-based architecture in order to support concurrent engineering design and automatic design part assembly. The system provides the capability of composing new designs from proper design elements stored in the database and knowledge-base. The distributed intelligent product design is applied to the design of an automobile part as an example.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1995년도 추계학술대회발표논문집; 서울대학교, 서울; 30 Sep. 1995
• /
• pp.46-58
• /
• 1995

Although numerous distributed database design models and solution algorithms have been developed, very few have been validated. Validation is critical to the successful application of such models to distributed database design. In this paper, we develop a simulation system for distributed database design. We then analyze and validate an average response time model using simulation. The simulation results demonstrate that the average response time model is reasonably accurate.

• Asia pacific journal of information systems
• /
• 제7권3호
• /
• pp.23-37
• /
• 1997

Although numerous models and solution algorithms to design efficient distributed databases have been developed, very few have been validated for their effectiveness. In this paper, we develop a simulation system which can be used to analyze and validate the average response time of distributed database designs. Our simulation system models comprehensive query processing strategies such as semijoin as well as a concurrency control mechanism We analyze and validate an average response time distributed database design model using our simulation system.

• 인터넷정보학회논문지
• /
• 제18권6호
• /
• pp.47-53
• /
• 2017

Recently, huge datasets have been generating rapidly in a variety of fields. Then, there is an urgent need for technologies that will allow efficient and effective processing of huge datasets. Therefore the problems of partitioning a huge dataset effectively and alleviating the processing overhead of the partitioned data efficiently have been a critical factor for scalability and performance in distributed database system. In our work we utilized multicore servers to provide scalable service to our distributed system. The partitioning of database over multicore servers have emerged from a need for new architectural design of distributed database system from scalability and performance concerns in today's data deluge. The system allows uniform access through a web service interface to concurrently distributed databases over multicore servers, using SQMD (Single Query Multiple Database) mechanism based on publish/subscribe paradigm. We will present performance results with the distributed database system built on multicore server, which is time intensive with traditional architectures. We will also discuss future works.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2004년도 봄 학술발표논문집 Vol.31 No.1 (B)
• /
• pp.115-117
• /
• 2004

Recently, mining far association rules in distributed database environments is a central problem in knowledge discovery area. While the data are located in different share-nothing machines, and each data site grows by time. Mining global frequent itemsets is hard and not efficient in large number of distributed sewen. In many distributed databases. time component(which is usually attached to transactions in database), contains meaningful time-related rules. In this paper, we design a new DTA(distributed temporal association) algorithm that combines temporal concepts inside distributed association rules. The algorithm confirms the time interval for applying association rules in distributed databases. The experiment results show that DTA can generate interesting correlation frequent itemsets related with time periods.

• 한국정보시스템학회지:정보시스템연구
• /
• 제4권
• /
• pp.85-104
• /
• 1995

In a loosely-coupled distributed database server system, a server failure and/or a communication failure can be masked by a resiliency mechanism. Recognizing that a distributed transaction executes at several servers during its lifetime, we propose a resiliency mechanism which allows continuous transaction processing in distributed database server systems in the presence of a server failure. The resiliency mechanism for transaction processing is achieved by keeping redundant information using a primary/backup approach. The purpose of this paper is to analyze the performance improvement opportunities with the resiliency mechanism and to present the design of the proposed system.

• 한국전자거래학회지
• /
• 제2권2호
• /
• pp.155-169
• /
• 1997

The CALS integrated database is a key information technology in which CALS implements an information sharing system to enable digital data transfers for technical and non-technical information in distributed and heterogeneous environments. Such heterogeneously distributed CALS information needs to be systematically incorporated so that it can provide a global data view for CALS users. In this paper, we investigated the technologies of CALS integrated database, and proposed a system prototype to implement an integrated data environment (IDE) utilizing distributed object environments CORBA (Common Object Request Broker Architecture).

• Journal of Communications and Networks
• /
• 제16권4호
• /
• pp.430-435
• /
• 2014

The performance of a distributed database system depends particularly on the site-allocation of the fragments. Queries access different fragments among the sites, and an originating site exists for each query. A data allocation algorithm should distribute the fragments to minimize the transfer and settlement costs of executing the query plans. The primary cost for a data allocation algorithm is the cost of the data transmission across the network. The data allocation problem in a distributed database is NP-complete, and scalable evolutionary algorithms were developed to minimize the execution costs of the query plans. In this paper, quadratic assignment problem heuristics were designed and implemented for the data allocation problem. The proposed algorithms find near-optimal solutions for the data allocation problem. In addition to the fast ant colony, robust tabu search, and genetic algorithm solutions to this problem, we propose a fast and scalable hybrid genetic multi-start tabu search algorithm that outperforms the other well-known heuristics in terms of execution time and solution quality.

• 컴퓨터교육학회논문지
• /
• 제4권1호
• /
• pp.145-152
• /
• 2001

분산객체 기술을 이용한 분산데이터베이스 시스템 개발은 현재의 컴퓨팅 환경을 그대로 사용하면서 적은 비용으로 시스템을 개발할 수 있기 때문에 많이 사용되고 있다. 따라서 현재 학교에서 운용중인 독립형 데이터베이스 시스템을 통합하는 분산데이터베이스 시스템을 개발하면 교사와 교육 공무원 모두에게 쉽게 자료를 통합하고 관리할 수 있는 시스템이 될 것이다. 따라서 본 연구는 CORBA, Java, JDBC를 이용하여 3-Tier 분산 데이터베이스 관리 시스템의 프로토타입을 설계하고 구현하고자 한다.

• Asia pacific journal of information systems
• /
• 제5권2호
• /
• pp.101-129
• /
• 1995

This paper proposes a form-based distributed database design methodology ($FD^3$). The methodology consists of five design phases such as (i) form requirement analysis (ii) schema integration (iii) distribution analysis (iv) distribution design, and (v) local logical/physical design. In the $FD^3$, all the important design information for each phase is obtained by using an organizations forms, Users requirements are analyzed by using forms that contain logical and quantitative information for distribution design. $FD^3$ resolves naming conflicts by employing SQLs based on the form field data in the schema integration phase. Furthermore, $FD^3$ enhances the quality of distributed database design by incorporating communication costs into the design model. A real-life case is illustrated to demonstrate the usefulness of the $FD^3$.