• Journal of Korea Multimedia Society
• /
• v.7 no.9
• /
• pp.1329-1338
• /
• 2004

The purpose of data mining is to extract multi-dimensional information from a large database. The only information that we can extract from a large database is the column name, data type or simple comments included in the columns of database tables. With such unstructured and scarce information, it is very difficult and time taking to collect and to cleanse data by analyzing the purpose, characteristic and schema of the column during the data preparation step. In order to solve this problem, we propose solutions for reducing the time spent data preparation step in a relational database environment in this paper. That is, we propose useful elements to be considered during the data preparation step and then these elements are organized to constitute MDR(Metadata Registry) which is becoming the international standard of ISO/IEC : ll179. Finally, we propose a XML-based distributed MDR retrieval system that is convertible among heterogeneous systems and heterogeneous DBMSS.

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

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

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.1867-1879
• /
• 1997

DREAM-S is a distributed main-memory database system for the real-time processing of shared operational datra in ATM switching systems. DREAM-S has a client-server architecture in which only the server has the diskstorage, and provides the T-Tree index structure for efficient accesses to the data. We propose a recovery technique for the T-Tree index structre in DREAM-S. Although main-memory database system offer efficient access performance, the database int he main-memory may be broken when system failure such as database transaction failure or power failure occurs. Therfore, a recovery technique that recovers the database (including index structures) is essential for fault tolerant ATM switching systems. Proposed recovery technique relieves the bottleneck of the server processors disk operations by maintaining the T-Tree index structure only in the main-memory. In addition, fast recovery is guaranteed even in large number of client systems since the T-Tree index structure(s) in each system can be recovered cncurrently.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11
• /
• pp.2875-2888
• /
• 1999

In this paper we present compiler-based active rule system to efficiently maintain spatial integrity constraints in a heterogeneous, distributed environment. Specially, the prototype active rule system presented has been developed as a component of a whole middleware system called SDBC(Spatile DataBase Connectivity). Due to this reason, our active rule system is provided for heterogeneous ODBMSs in a distributed environment and used to define spatial integrity constraints using the active rules in E-C-A(Event-Condition-Action) type. Using this active rule system, an application programmer can free himself from a heavier burden on the integrity maintenance of application objects. In the compiler-based approach, active rules applicable to events raised by a database program are directly inserted into the program in a function type by the preprocessor, and then they are compiled with the application program source codes. One advantage of this approach is that there is no run-time overhead accompanied by monitoring all the database transitions when preprocessed program is executed. This active rule system also provides facilities to manage changed rules and dynamically interpret those rules at run-tuime.

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

• Journal of Korea Game Society
• /
• v.1 no.1
• /
• pp.31-36
• /
• 2001

Generally, the internet online game systems are divided into two parts, clients and servers. The clients provide a connection with game server to each user and communicate between them. And, the server controls all clients by the game rules fairly and manages database systems to maintain the user information. In this paper, we propose a configuration method for internet online game servers using distributed scheme. To apply this method, we divide game server into three sub-level parts again. First part of game server is login server to establish the connection between communication server and clients. Second part is communication server to connect between clients and main game server during playing the game. And last part is DBMS that performs database independently. Our proposed scheme suggests that the game server operates very stable because of decreasing of processing load by distributed scheme. So, our proposed server configuration applies to similar online game easily.

• International Journal of Computer Science & Network Security
• /
• v.21 no.12
• /
• pp.280-292
• /
• 2021

Enterprise Resource Planning (ERP) is a software that manages and automate the internal processes of an organization. Process speed and quality can be increased, and cost reduced by process automation. Odoo is an open source ERP platform including more than 15000 apps. ERP systems such as Odoo are all-in-one management systems. Odoo can be suitable for small and medium organizations, but duo to efficiency limitations, Odoo is not suitable for the large ones. Furthermore, Odoo can be implemented on both local or public servers in which each has some advantages and disadvantages such as; the speed of internet, synced data or anywhere access. In many cases, there is a persistent need to have more than one synchronized Odoo instance in several physical places. We modified Odoo to support this kind of requirements and improve its efficiency by replacing its standard database with a distributed one, namely CockroachDB.

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.30 no.5
• /
• pp.21-28
• /
• 2012