• The Transactions of the Korea Information Processing Society
• /
• v.5 no.4
• /
• pp.873-882
• /
• 1998

The parallel database machine approach is currently widely and successfully used. There are four major architectures which are used in this approach: shared-nothing architecture, shared-evertying architecture, shared-disk architecture, and hybrid architecture. In this paper, we use an analytical model to evaluate the performance of these database machine architectures. We define an abstract model for each type of database machine design to obtain performance equatons describing the execution times with respect to the hybrid hash join poeration. Using the performance equations, we evaluate the execution times of the various database machine design models.

• Proceedings of the Korea Database Society Conference
• /
• 1999.06a
• /
• pp.95-102
• /
• 1999

The web-based group collaborative systems are emerging as enterprise-wide information systems. Since data in group collaborative systems are apt to be shared among multiple concurrent users and modified simutaneously by them, the web-based group collaborative systems must support synchronous collaboration in order to provide users with synchronized and consistent views of shared data. This Paper proposes an active web server which can facilitate synchronous collaboration in web-based group collaborative systems. To accomplish such a goal, the active web server manages dependency relationships between shared data and web browsers referencing them and actively propagates changing details of the shared data to all web browsers referencing them. And, this paper examines usefullness and effectiveness of the active web server to apply it to the ball-bearing design example of concurrent engineering design systems. The prototype system of the active web server is developed on a commercial Object-oriented Database Management System (ODBMS) called OBJECTSTORE using the C＋＋ programming language.

• Asia pacific journal of information systems
• /
• v.8 no.3
• /
• pp.21-36
• /
• 1998

Group collaborative systems are recently emerging to support a group of users engaged in common tasks such as group decision making, engineering design, or collaborative writing. Simultaneously, as communications networks and distributed database systems become core underlying architecture of the organization, the need of collaborative systems are gaining more attentions from industry. In such collaborative systems, as the shared objects may evolve constantly or change for operational purposes, providing the users with synchronized and consistent views of the shared object and maintaining the consistency between shared object and replicated objects are important to improve the overall productivity. This paper provides an change management framework for the group collaborative systems to facilitate managing dependency relationships between shared objects and dependents, and coordinating change and propagation activities in distributed computing environments. Specifically, the framework adopts an object-oriented database paradigm and presents several object constructs capturing dependency management and change notification mechanisms. And the proposed framework accommodates both persistent dependents such as replicated data and transient dependents such as various user views in a single formalism. A prototype system is developed on a commercial object-oriented database management system called OBJECTSTORE using the C++ programming language.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.04a
• /
• pp.670-674
• /
• 1996

In automated search of a design database to support mechanical design, it is necessaryto recognize a shape pattern which represents a design object. This paper introduces the concept of a surface relation graph (SRG) for recognizing shape patterns from a 3D boundary representation scheme of a solid model(a B-rep model). In SRG, the nodes and arcs correspond to the faces and edges shared by two adjacent faces, respectively. An attribute assigned to an arc is given by an integer which discriminates the relationship between two adjacent faces. The + sign of the integer represents the geometric convexity of the solid, and the -sign the concivity at the shared edge. The input shape is recognized by comparison with the predefined features which are subgraphs of the SRG. A hierarchyof the database for upporting the design is presented. A search for the design database is also discussed. The usefulness of this method is illustrated by some application results.

• Journal of KIISE:Databases
• /
• v.35 no.6
• /
• pp.469-480
• /
• 2008

A shared disk (SD) cluster couples multiple nodes for high performance transaction processing, and all the coupled nodes share a common database at the disk level. To reduce the number of disk accesses, each node caches database pages in its memory buffer. Since a particular page may be cached simultaneously in different nodes, cache consistency should be maintained to ensure that nodes can always access the most recent version of database pages. Most cache consistency schemes proposed in the SD cluster adopted LRU as a buffer replacement algorithm. In this paper, we first present four buffer replacement algorithms that consider the characteristics of the SD cluster. Then we compare the performance of the buffer replacement algorithms. We perform the experiments on a variety of cluster configurations and database workloads. The experiment results show that the proposed algorithms achieve performance improvement up to 5 times of LRU algorithm.

• Journal of the Korean Society for Railway
• /
• v.11 no.2
• /
• pp.126-138
• /
• 2008

This paper proposes the preservation method that can effectively process short messages at mobilePOST SMSC(Short Message Service Center) platform on CDMA(Code Division Multiple Access). There are three techniques for the preservation method. First one is shared memory technique where several processes within the system share same memory to process transmission of short messages with maximum performance. Second one is to back-up messages in shared memory to the file system to prevent lost during system initialization or other unstable period. Third technique is that when transmission of short message was completed, finished message is moved from the shared memory to relational database for accounting purposes.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.47
• /
• pp.139-148
• /
• 1998

CALS IDB (Integrated database) is one of core technologies that embodies the principle of a shared data environment for the life cycle related data in CALS environment. In this study, to successfully share the data, we first classified the data types employed in the CALS environment and then discussed the data heterogeneity issued in data integration processes. To effectively solve this heterogeneity, we proposed the federated database systems as a candidate system especially focusing on the major functions and core element technologies.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.4
• /
• pp.168-173
• /
• 2002

According to the rapid growth of Internet service, electronic commerce usage scale is growing every year. It requires the method of vitalizations of electronic commerce through reducing the software development cost and making easy of data construction. Web service, which is adapting distributed technology based on internet supports the infrastructure of reducing the software development cost through software sharing. As the shared software modules access the same data, they can reference the same data on the other site. In this paper, we designed and implemented database Processing module of the electronic commerce program using web service technology, which can make easy of site construction and sharing database. Implemented database processing module supports data selection modification insertion deletion and searching. Using this functions we showed product item information could be shared among the other electronic commerce sit.

• Proceedings of the CALSEC Conference
• /
• 2001.08a
• /
• pp.591-596
• /
• 2001

To deliver new products to market in a due time, companies often develop their products with numerous partners distributed around the world. Internet technologies can provide a cheap and efficient basis of collaborative product development among distributed partners. This paper provides a framework and its product database model that can support consistent product data during collaborative product development. This framework consists of four components for representing consistent product structure: the product configuration, assembly structure, multiple representations and engineering changes. A product database model realizing the framework is designed and implemented as a system that supports collaborative works in the areas of product design and technical publication. The system enables participating designers and technical publishers to complete their tasks with shared and consistent product data. It also manages the propagation of engineering changes among different representations for individual participants. The Web technologies introduced in this system enable participants to easily access and operate shared product data in a standardized and distributed computing environment.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.189-192
• /
• 2005

In this paper, we present a Petri Net (PN) model for reliability analysis of a shared database system. The system consists of components; a database, two processors, two memory and a bus. The database should be operational and at least one of the component should be also operational. Otherwise system will be down. Each component can be failed and repaired individually. Stochastic Reward Net (SRN) Model for reliability analysis is developed. SRN is potential to define various reward function and can be easily used to obtain performance measures. The modeling techniques using variable cardinality, enabling function, timed transition priority in SRN are shown.