• Asia pacific journal of information systems
• /
• v.5 no.2
• /
• pp.131-142
• /
• 1995

In distributed database systems materialized views are useful to solve many problems caused by data replication. This paper deals with the problem of updating materialized views incluing join operations. We use a differential update which uses logs that record the change of base tables in certain periods. This method avoids locking of the base tables so that it makes the system more efficient. We update materialized views periodically to save the updating cost envolved. A screen test is applied to differential files to eliminate tuples that are irrelevant to any of the views being updated. Using these methods, a detailed procedure is addressed to refresh materialized views. Then we show that our update procedure performs better than a semijoin approach.

• The Journal of Society for e-Business Studies
• /
• v.5 no.1
• /
• pp.105-122
• /
• 2000

Enterprise integration and virtual enterprise are practical visions of industrial information implementations in the information society. In these environments, the distributed and heterogeneous data sources should be exchanged and shared in effective and integrated way. However, the distributed and heterogeneous data sources are managed by independent and heterogeneous computer systems, thus system users and developers are faced difficulties in implementing enterprise integration environments, In this study, we designed and developed a database broker system utilizing a routing broker method to provide transparent location access mechanisms for the distributed and heterogeneous data sources. The proposed mechanism is designed to act as a middle tier between clients and multiple servers, and adopts Java, CORBA, and JDBC as its state-of-the-art techniques.

• The Journal of Information Technology and Database
• /
• v.4 no.2
• /
• pp.79-95
• /
• 1998

Useful data being distributed over several systems, we have a problem in accessing and utilizing them. Recognizing this problem, researchers have proposed two concepts as solutions to the problem, multidatabase and data warehouse. The one provides a virtual view over the distributed data, and the latter is a materialized view of it. Recently, more attention has been paid to the latter, which is a single of distributed database, collected along a time dimension. So, the major issues in building a data warehouse are 1) how to define a global schema for the data warehouse, 2) how to capture changes from local databases, and 3) how to represent time-varying values of data item. This paper presents an integrated approach to these issues, borrowing the research results from such areas as multidatabase, active databases and temporal databases.

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

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.24 no.64
• /
• pp.1-20
• /
• 2001

In distributed databases, file replication and workload allocation are important design issues. This paper solves these two issues simultaneously, The primary objective is to minimize the system response time that consists of local processing and communication overhead on a local area network. Workload (query transactions) is assigned among any sites in proportion to the remaining file request service rate of the each server The problem is presented in the form of a nonlinear integer programming model. The problem is proved to be NP-complete and thus an efficient heuristic is developed by employing its special structure. To illustrate its effectiveness, it is shown that the proposed heuristic is based on the heuristic of a non-redundant allocation that was provided to be effective. The model and heuristics are likely to provide more effective distributed database designs.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.18 no.33
• /
• pp.1-10
• /
• 1995

The allocation of files is essential to the efficiency and effectiveness of a distributed system that must meet geographically dispersed data processing demands. In this paper, we address an optimization model that generates optimal file migration policies in distributed database systems. The proposed model is a more generalized model that includes system's capacity constraints - computing sites' storage capacity and communication networks' capacity - which have not taken into consideration in previous researches. Using this model, we can establish initial file allocation, file reallocation and file migration polices that minimize a system operating cost under system's capacity constraints at an initial system design or reorganization point The proposed model not only can be adopted by small-sized systems but also provides a foundation for effective and simple heuristics for adaptive file migration in large systems.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1680-1686
• /
• 1996

The deterministic update method of intensional predicates in a parallel deductive database that deductive database is distributed in a parallel computer architecture in needed. Using updated data from the deterministic update method, a strategy for parallel evaluation of intensional predicates is required. The paper is concerned with an approach to updating parallel deductive database in which very insertion or deletion can be performed in a deterministic way, and an extended parallel semi-naive evaluation algorithm in a parallel computer architecture. After presenting an approach to updating intensional predicates and strategy for parallel evaluation, its implementation is discussed. A parallel deductive database consists of the set of facts being the extensional database and the set of rules being the intensional database. We assume that these sets are distributed in each processor, research how to update intensional predicates and evaluate using the update method. The parallel architecture for the deductive database consists of a set of processors and a message passing network to interconnect these processors.

• Journal of the Semiconductor & Display Technology
• /
• v.3 no.4
• /
• pp.13-17
• /
• 2004

As the usage of wireless LAN becomes common in working environment, the number of database systems that support both wired and wireless users increases rapidly. The characteristics of wireless LAN that its speed is slow relatively comparing to wired network and the users in its environment connects to different communication points as they moves creates another challenge to be resolved in database systems. In the environment of hybrid communication systems, wired and wireless for voluminous data amount and a number of users, the two layer architecture of the conventional client-server database systems has limitation in the system performance. This is due to that server is the only point of data service in client-server database systems. In this paper, we discuss a new extended database system architecture that data services are distributed among servers and clients based on user database access patterns in order to improve system performance. We analyze the expected system performance by using simulation technique and prove the practical utilization of the system by demonstrating experimental results.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 1995.04a
• /
• pp.153-158
• /
• 1995

보 및 평판의 진동에 대해서 에너지의 손실은 재료감쇠를 이용한 표면감쇠처리나 지지부에서의 감쇠처리에 의하여 증가될 수 있다. 감쇠재료를 이용한 표면감쇠처리의 예로서 보/평판 표면에 접착되는 감쇠 테이프나 코팅등은 아주 효과적임이 입증되었다. 마찬가지로 지지부 감쇠처리는 점탄성재료의 삽입에 의해서 설명될수 있다[1]. 보/평판의 감쇠에 대한 최근의 많은 연구들은 진동하고 있는 보/평판의 표면에 적용하는 감쇠 테이프 혹은 적층형태의 감쇠 처리방법에 대해서 주로 수행되었다. 일반적으로 표면감쇠처리방법은 진동감소에 아주 효과적이지만 실제 적용상에서 항상 가능한 것은 아니며, 이와 같은 경웨는 지지부 감쇠 처리방법에 의존하게 된다[2]. 감쇠특성을 갖는 점탄성재료를 실제로 적용할 때 보/평판의 유한한 길이가 점탄성재료로 지지되며 점탄성재료의 물성치와 치수에 따라서 계의 모우드 매개변수(고유진동수, 계의 손실계수 그리고 모우드형상)가 크게 달라진다. 그리고 이와 같은 계에 대해서는 지지부의 거동보다는 전체 시스템의 고유진동수와 손실계수 그리고 보 영역에서의 모우드 형상에 더 관심이 있으므로 지지부 영역을 집중매개변수(lumped parameter)로 나타내어 계를 해석할 수 있다. 일반적으로 보와 평판의 경계에서는 병진 및 회전방향의 강성 뿐만 아니라 두 강성사이에 연성효과도 동시에 발생하게 되므로 이 항을 고려하여 계를 모델링해야 한다. 본 연구에서는 우선 점탄성 재료에 의한 지지부영역의 등가 강성계수들을 구하고 경계에 강성행렬을 갖는 보의 등가시스템을 얻는다. 그리고 등가시스템의 주파수방정식으로부터 모우드 매개변수에 대한 지지부의 영향을 살펴본다. 또한 시스템이 비교적 복잡한 사각 평판의 진동에 대해서도 동강성행렬법(dynamic stiffness matrix method)을 이용하여 해석하고자 한다. 수준임이 입증되었다. 본 연구의 결과를 토대로우리나라 젊고 건강한 남성에게 적합한 무게상수는 작업자군에 대하여 25.05kg, 학생군에 대하여 20.24kg 으로 나타나 이는 미국 NIOSH 안전기준과 대체로 일치함을 발견하였다.ive structures utilized in Client/server architecture for distribution and cooperative processing of application between server and client this study presents two different data management methods under the Client/server environment; one is "Remote Data Management Method" which uses file server or database server and. the other is "Distributed Data Management Method" using distributed database management system. The result of this study leads to the conclusion that in the client/server environment although distributed application is assumed, the data could become centralized (in the case of file server or database server) or decentralized (in the case of distributed database system) and the data management method through a distributed database system where complete responsi

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.10
• /
• pp.1935-1944
• /
• 1994

FMS is a distributed system composed of various programmable manufacturing hardware such as robots and NC machines. For the autonomous operation of such a system, an integrated software layer for the control and monitoring in needed on top of the manufacturing hardware. However, constructing and maintaining such a software layer is difficult due to the complexity of a underlying FMS and its frequently changing nature. To cope with this problem, this paper proposes an object-oriented FMS integration model, in which objects acting as virtual manufacturing cells are instantiated for each physical cell in the underlying object-oriented database. Various other entities involved in manufacturing processes and their relationship to the cell objects are also captured in the database. This paper describes the structure of this object-oriented FMS database on our prototype implementation called FREE.