• Proceedings of the IEEK Conference
• /
• summer
• /
• 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.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.09a
• /
• 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
• /
• v.7 no.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.

• Journal of Internet Computing and Services
• /
• v.18 no.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.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• 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.

• The Journal of Information Systems
• /
• v.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.

• The Journal of Society for e-Business Studies
• /
• v.2 no.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
• /
• v.16 no.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.

• The Journal of Korean Association of Computer Education
• /
• v.4 no.1
• /
• pp.145-152
• /
• 2001

The development of distributed databases using a distributed object technology is more popular than ever before because the current computer system environment is adaptable for a use as well as the cost of the integration of legacy systems is cheaper than making a new application. In schools, development of an integrated system consisted of many stand-alone databases give a teacher and an administrator the convenience of managing the database in a school and the ease integration of data in it. Therefore, this research is to design and implement the 3-tier distributed database using CORBA, Java and JDBC.

• Asia pacific journal of information systems
• /
• v.5 no.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$.