• Journal of the Korean Society for information Management
• /
• v.8 no.2
• /
• pp.3-31
• /
• 1991

A prototype model of intelligent information retrieval system is presented with the definition of intelligent information retrieval. An intelligent information retrieval system for Korean documents was designed, and the system was implemented with Turbo Prolog 2.0 and Turbo Pascal 5.5. The characteristics of the system include natural language interface, user modeling, automatic indexing by case relationship, and multiple retrieval techniques.

• Journal of the Korean Society for information Management
• /
• v.11 no.2
• /
• pp.89-110
• /
• 1994

Upon completion of this study it became evident that users are more satisfied with information service with systematic arrangement, accessibility, updatedness, and abundance of information in the Scientific & Technical Library as well as skillfullness of librarians with academic background in the Library and Information Science. It is suggested that the Scientific & Technical Library carry out their missions on information networks with outside organizations using database systems.

• The Journal of Information Technology and Database
• /
• v.1 no.2
• /
• pp.127-145
• /
• 1994

컴퓨터의 각종 응용 시스템들이 다루는 데이타의 양과 복잡도가 높아짐에 따라 이를 효율적으로 다루기 위해 메타-데이타(meta-data)의 중요성이 날로 부각되고 있다. 하지만, 현재 DBMS의 기능은 조직체내의 데이타의 사용을 기술하고 제어하는 메타 데이타인 정보 자원(information resource)의 관리에는 그 기능이 미치지 못하고 있다. 최근들어, 이런 정보 자원들을 효율적으로 다루기 위해 차세대 정보 관리 시스템으로서 정보 자원 사전 시스템(Information Resource Dictionary System)이 제안되었다. 본 논문에서는 현재 표준화중인 정보 자원 사전 시스템을 분석하고, IRDS 서비스 인터페이스를 관계 DBMS를 기반으로 설계하고 구현하였으며, 이를 응용하여 그 효용성을 실험하였다.

• Journal of KIISE:Databases
• /
• v.33 no.7
• /
• pp.668-681
• /
• 2006

Due to its diverse advantages, XML has secured its position as a standard for data representation and exchange in the Internet. As a consequence, there has been much research on efficient storing and query processing of in data. Storing XML data in a relational database system warrants much benefit in data management and query processing; the system provides a strong query processing and data management function and can be applicable to XML data, its function being extended. In this paper, we design and implement a query translator that translates XQuery, a representative XML query language, into SQL:2003 query. SQL:2003, the latest SQL standard used as a substitute for SQL:1999, defines SQL/XML that supports XML. The main contribution of this paper is as follows: First, we look into the supporting features of XML, defined in the SQL:2003 standard, and propose a user-defined function for shortcoming sections. Second, we propose a way to translate XQuery into SQL that observes the latest SQL standard. Third, we describe in detail the design and the implementation of the translator to show its feasibility as a translator.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.429-440
• /
• 2002

Temporal databases manage time-evolving data. They provide built-in supports for efficient recording and querying of temporal data. The temporal aggregate in temporal databases is an extension of the conventional aggregate to include time concept on the domain and range of aggregation. This paper focuses on multidimensional temporal aggregation. In a multidimensional temporal aggregate, we use one or more general attributes as well as a time attribute on the range of aggregation, thus it is a useful operation for historical data warehouse, Call Data Records(CDR), etc. In this paper, we propose a structure for multidimensional temporal aggregation, called PTA-tree, and an aggregate processing method based on the PTA-tree. Through analyses and performance experiments, we also compare the PTA-tree with the simple extension of SB-tree that was proposed for temporal aggregation.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.665-676
• /
• 2001

The most expensive spatial operation in patial database in a spatial join which computes a combined table of which tuple consists of two tuples of the two tables satisgying a spatial predicate. Although the execution time of sequential processing of a spatial join has been so far considerably improved the response time is not tolerable because of not meeting the requiremetns of interactive users. It is usually appropriate to use parallel processing to improve the performance of spatial join processing. in spatial database the fixed grids which consist of the regularly partitioned cells can be employed the previous works on the spatial joins have not studied the parallel processing of spatial joins using fixed grids. This paper has presented an analytical cost model that estimates the comparative performance of a parallel spatial join algorithm based on the fixed grids in terms of the number of MBR comparisons. disk accesses, and message passing, Several experiments on the synthetic and real datasets show that the proposed analytical model is very accurate. This most model is also expected to used for implementing a very important DBMS component, Called the query processing optimizer.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.4
• /
• pp.47-56
• /
• 1999

We design and implement an ORDBMS-based geographic information system for sightseeing information of Chungbuk to verify the performance and applicability of GEUS/XTM ORDBMS. We Acquire the positional coordinates of the boundaries of administrative districts , roads, and railroads, determine the various kinds of information such as the locations of sightseeing sites, lodgings, and so on, design an object-relational schema using OMT, and implement the geographic information system including a database system. Through the examination of selective accessibility on the sightseeing inform ation database by the various queries, we conclude that the ORDBMS is more applicable than other DBMSs in modeling, storing, referring, and managing of non-fixed complex data such as sightseeing information. Therefore, ORDBMSs provide efficient and extensible implementations of databases and information services from various sources for the increasing demand on geographic information service on internet.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.05b
• /
• pp.783-786
• /
• 2003

교육망의 과학적 관리는 정확한 데이터를 처리해서 얻은 정보에 따라 행해진다. 이러한 시스템을 정보망 시스템(Information Network System)이라 하는데 이것의 중추적인 기능을 담당하고 있는 것이 웹 데이터 베이스 관리 시스템이다. 본 연구에서는 웹 종합정보망을 이용하여 대학평가 작업을 정확하고 효율적으로 수행하고자 하는 데 그 목적이 있다. 웹 망은 정보 시스템의 심장부가 되며 이를 나양한 기법들과 결합시켜서 보다 지능적으로 만들 수 있다. 대학 행정망에 필요한 자료들을 어떻게 구성하고 가공하느냐가 과학적 관리의 관건이 될 것이다. 이런 이유로 격동하는 대학가의 위기에 능동저긍로 대처하기 위한 한 전략으로 대학의 현재를 객관적으로 평가하기 위한 대학평가 시스템을 개발하였다. OODBMS(Object Oriented Data Base Management System)를 통해 멀티미디어 정의구축과 정보유지 및 재사용 가능성을 극대화하고자 한다.

• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.367-380
• /
• 2002

Due to recent increase in applications requiring huge amount of data such as spatial data analysis and image analysis, clustering on large databases has been actively studied. In a hierarchical clustering method, a tree representing hierarchical decomposition of the database is first created, and then, used for efficient clustering. Existing hierarchical clustering methods mainly adopted the bottom-up approach, which creates a tree from the bottom to the topmost level of the hierarchy. These bottom-up methods require at least one scan over the entire database in order to build the tree and need to search most nodes of the tree since the clustering algorithm starts from the leaf level. In this paper, we propose a novel top-down hierarchical clustering method that uses multidimensional indexes that are already maintained in most database applications. Generally, multidimensional indexes have the clustering property storing similar objects in the same (or adjacent) data pares. Using this property we can find adjacent objects without calculating distances among them. We first formally define the cluster based on the density of objects. For the definition, we propose the concept of the region contrast partition based on the density of the region. To speed up the clustering algorithm, we use the branch-and-bound algorithm. We propose the bounds and formally prove their correctness. Experimental results show that the proposed method is at least as effective in quality of clustering as BIRCH, a bottom-up hierarchical clustering method, while reducing the number of page accesses by up to 26～187 times depending on the size of the database. As a result, we believe that the proposed method significantly improves the clustering performance in large databases and is practically usable in various database applications.

• Journal of the Korean Society for information Management
• /
• v.10 no.1
• /
• pp.15-30
• /
• 1993

Hypermedia system supports associative linking concept for multimedia information using link and node concept, and overcomes the limitations of database system and text retrieval system in some application areas. This study shows the design and implementation of a hypermedia system which supports text, graphics, image and voice /sound information. This system has been designed to integrate the browsing and searching functions of the hypermedia system for efficient multimedia information retrieval and user-interface. To demonstrate the function and capability of the system, an application was made in the area of Bible and related information.