• 전기의세계
• /
• v.45 no.9
• /
• pp.3-8
• /
• 1996

CALS를 추진하여 얻을 수 있는 기대효과는 다음과 같다. 첫째, 공유된 정보로부터 가장 최적의 선택을 할 수 있다. 둘째, 이형/분산 환경의 데이타베이스 및 응용 시스템을 사용자는 단일 시스템과 같이 운영할 수 있다. 셋째, 가상기업을 구축하는 과정에서 업무절차의 표준화 및 혁신을 필수적으로 병행된다. 넷째, 생산에서 배치에 소요되는 기간을 단축시킴으로서 기업의 경쟁력을 향상시킬 수 있다. 다섯째, 공통적인 필요 기술을 바탕으로 전 제조업 및 서비스업 등 여러가지 응용분야에 적용할 수 있다.

• Proceedings of the CALSEC Conference
• /
• 1997.11a
• /
• pp.377-384
• /
• 1997

. 표준 진행 사항 - Part 22 (SDAI): FDIS - Part 12 (EXPRESS-I): Technical Report Type II . 새로운 기술, 표준 접목 노력 - CORBA - Java - SGML . 활용 기술 개발 및 구현 - CALS 및 PDM 관련 응용 제품 - 일본 STEP Center의 적극적 참여(중략)

• Journal of the Society of Naval Architects of Korea
• /
• v.31 no.3
• /
• pp.38-46
• /
• 1994

The role of CIMS(Computer Integrated Manufacturing Systems) is to integrate various applications throughout a product's life cycle. STEP is an international effort to standardize information models and interfaces so that independently developed applications can be easily integrated. A prototype for the Ship CIMS is built using STEP. In this prototype, the information model defined by EXPRESS is translated into database schemas. In this paper, we explain the operation of this prototype using the examples from two application programs, i.e., the Block Division System and the Erection System which are used for the process planning of ship manufacturing. As an example. Real data stored in a relational database system(Oracle) is presented in this paper.

• Journal of KIISE:Databases
• /
• v.32 no.1
• /
• pp.12-23
• /
• 2005

In the past decade, advances in speed of commodity CPUs have iu out-paced advances in memory latency Main-memory access is therefore increasingly a performance bottleneck for many computer applications, including database systems. To reduce memory access latency, cache memory incorporated in the memory subsystem. but cache memories can reduce the memory latency only when the requested data is found in the cache. This mainly depends on the memory access pattern of the application. At this point, previous research has shown that B+ trees perform much faster than T-trees because B+ trees are more cache conscious than T-trees, and also proposed 'Cache Sensitive B+trees' (CSB. trees) that are more cache conscious than B+trees. The goal of this paper is to make T-trees be cache conscious as CSB-trees. We propose a new index structure called a 'Cache Sensitive T-trees (CST-trees)'. We implemented CST-trees and compared performance of CST-trees with performance of other index structures.

• Proceedings of the Korea Database Society Conference
• /
• 1997.10a
• /
• pp.463-471
• /
• 1997

비디오 데이타는 다양하고 방대한 양의 의미를 포함하고 있어 효율적인 내용기반 검색을 지원하기 위해서는 비디오 데이타를 기술하는 구조적이고 체계화된 형태의 메타데이타가 요구된다. 이러한 메타데이타는 검색 시 색인과 같은 역할을 수행하게 되므로 내용 기반검색의 가장 기본적이고 필수적인 데이타이다. 본 논문에서는 뉴스 응용 분야(News On Demand：NOD)를 적용한 비디오 데이터베이스 시스템의 효율적인 내용 기반 검색을 위한 메타데이타를 분류하고, Rambaugh의 OMT기법을 이용하여 메타데이타를 모델링한 후 질의 유형에 따라 모델의 접근 경로를 검사하여 모델을 검증하였다.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.362-371
• /
• 2005

Similarity indexing and searching are well known to be difficult in high-dimensional applications such as multimedia databases. Especially, they become more difficult when multiple features have to be indexed together. In this paper, we propose a novel indexing method called the GB-index that is designed to efficiently handle complex similarity queries as well as relevance feedback in high-dimensional image databases. In order to provide the flexibility in controlling multiple features and query objects, the GB-index treats each dimension independently The efficiency of the GB-index is realized by specialized bitmap indexing that represents all objects in a database as a set of bitmaps. Main contributions of the GB-index are three-fold: (1) It provides a novel way to index high-dimensional data; (2) It efficiently handles complex similarity queries; and (3) Disjunctive queries driven by relevance feedback are efficiently treated. Empirical results demonstrate that the GB-index achieves great speedups over the sequential scan and the VA-file.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.2
• /
• pp.167-173
• /
• 2002

The VMSS(Virtual Makeup Simulation System) is a virtual simulation system which can apply makeup, hair style, accessory to user's own face image through internee connection. The simulation result can be stored to server side DB and also can be printed out on client side printer. It is implemented using Java so, clients don't need any other client program to run the VMSS except Web browser and Java Plug-in installed on browser. IIS (Internet Information Server) Web server of Window 2000 and MS-SQL 7 are used to develop the overall system. Commercial JDBC Driver Type 4 is used to connect the applet and DB. It suggests a new direction of Web-based contents service development and can be applied to many other areas.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.7
• /
• pp.380-389
• /
• 2006

In this paper, we present the MGrid system and its application for the construction of the Glycoconjugates simulation database called e-Glycoconjugates. The MGrid system is an integrated molecular simulation grid system for computing, databases, and analyses. For e-Glycoconjugates, we have been constructing the simulation database for 2,000 glycan chains and 100 glycoproteins until 2008. In this paper, we present the goal, architecture, and current implementation status of the MGrid system, and e-Glycoconjugates.

• Journal of KIISE:Software and Applications
• /
• v.31 no.10
• /
• pp.1400-1411
• /
• 2004

There are many cases that many XML documents have different DTDs in spite of having a similar structure and being logically same kind of document. For this reason, It occurs a problem that these XML documents have different database schema and are stored in different databases. So, in this paper, we propose an algorithm that unifies DTDs of these XML documents using the finite automata and the tree structure. The finite automata is suitable for representing repetition operators and connectors of DTD, and is a simple representation method for DTD. By using the finite automata, we are able to reduce the complexity of algorithm. And we apply a proposed algorithm to unify DTDs of science journals.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.6
• /
• pp.663-673
• /
• 1999

WWW에 있어서 데이타베이스 통로는 필수적이다. 데이타베이스를 이용한 대부분의 웹 서비스는 CGI를 통해서 이루어지고 있는데 본 논문에서는 CGI가 갖는 문제점을 근본적으로 해결하기 위한 프레임웍으로서 JAQS(JAva Query Stub)를 제안하고 있다. JAQS를 통하여 이루어지는 서비스는 HTTP의 비연결성(connectionless) 및 무상태성(stateless)을 극복함으로써 상태 및 트랜잭션 관리를 지원할 수 있음은 물론 자바언어로 구현되어 플랫폼 독립적인 구조와 다중쓰레드를 최대한 활용하고 있다. 또한 JAQS와 함께 제안하고 있는 JAQS 관리자를 이용하면 데이타베이스가 분산되어 있는 환경에서도 효율적으로 동작할 수 있는 구조로 이루어져있다.Abstract Database gateway is absolutely vital to web-based services. Most web-based services with DBMS are implemented using CGI(Common Gateway Interface). This paper proposes a framework, dubbed JAQS(JAva Query Stub), as a solution for problems of CGI. JAQS not only supports state/transaction management by overcoming the connectionless and stateless nature of HTTP, but also effectively guarantees platform/DBMS-independence and multi-threading abilities because JAQS is implemented using Java. Also, using the JAQS Manager additionally proposed in this paper, JAQS can operate efficiently even in distributed database environments.