• Annual Conference on Human and Language Technology
• /
• 1998.10c
• /
• pp.105-110
• /
• 1998

SGML/XML은 임의 형태 문서, 임의 응용에 대해 일반화 마크업을 정의하기 위한 방법을 기술하는 메타언어이다. 즉 문서의 작성시에 고려되는 문서의 논리적 정보를 표현 가능하다. 이러한 논리적 구분을 이용하여 정보사용자에게 좀 더 정확한 검색을 제공할 수 있다. SGML/XML을 이용하여 표현된 계층적 논리정보를 이용하여 다양한 문서 접근점을 제공할 수 있으며, 문서의 재사용 및 동적인 문서제시를 가능케 한다. 본 논문에서는 SGML/XML 정보검색의 장점과 이러한 시스템을 구현하기 위한 구현 단계 및 구성요소를 알아보고자 한다. 아울러 구현사례로 STEER-SGML/XML 검색 시스템을 알아본다.

• Journal of Korea Multimedia Society
• /
• v.8 no.5
• /
• pp.596-605
• /
• 2005

Conventional XML query methods such as simple keyword match or structural query expansion are not sufficient to catch the underlying information in the documents. Moreover, these methods inefficiently try to query all the documents. This paper proposes document tittering and query expansion methods that are based on ontology. Using ontology, we construct a universal DTD that can filter off unnecessary documents. Then, query expansion method is developed through the analysis of concept hierarchy and association among concepts. The proposed methods are applied on variety of sample XML documents to test the effectiveness.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10b
• /
• pp.350-352
• /
• 1998

최근 들어서 사무자동화 시스템(Office Information System), 디지털 도서관(Digital Library), WWW(WorldWideWeb)등의 응용에서는 대량의 문서들의 정보를 효율적으로 저장하고 처리, 검색할 수 있는 기능을 요구하고 있다. 이에 대해 최근에 인터넷 기반의 무서 표준인 XML(eXtensible Markup Language)이 제시되었고, 이러한 XML 문서를 저장하고 처리, 검색하기 위한 다양한 연구들이 진행되고 있다. 그러나, 이러한 대부분의 연구들은 XML 문서의 구조적 정보만을 저장하고 검색하도록 설계되어 지고 있으며, XML 문서가 지닌 또 다른 정보인 링크 정보를 저장하고 검색하는 기능을 제공되지 않고 있다. 본 논문에서는 현재 파서나 브라우저 수준에서 제공해 주는 링크의 브라우징을 확장하여 데이터베이스로 수많은 XML문서의 링크 정부들을 저장하고 저장된 링크 정보들에 대해 사용자들이 검색할 수 있는 시스템을 개발하고자 한다. 이를 위해 링크 정보를 지워할 수 있는 XML 문서에 대한 데이터 모델을 제시하고 이러한 데이터 모델로 지원할 수 있는 질의어들을 설계하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10a
• /
• pp.57-59
• /
• 1999

현재 WWW(World Wide Web), 사무 자동화 시스템(Office Information System), 전자 도서관(Digital Library) 등의 빠른 발전으로 인하여 정보가 기하급수적으로 증가하였다. 이러한 방대한 양의 정보를 처리하기 위하여 많은 인터넷 기반의 문서 표준들이 출현하였고, 대표적으로 XML(eXtensible Markup Language)이 차세대 인터넷 전자 문서의 표준으로 많은 곳에 응용되고 있다. 이에 따라 XML 문서의 정보들을 효율적이고 정확하게 저장하고 이용, 검색 할 수 있는 기능을 요구되어졌다. 현재 대부분의 연구들은 XML 문서에 대한 구조적인 정보만을 저장하고 검색하는 기능만을 지원 할 뿐 검색된 결과에 대한 재사용이나 재구성에 대한 기능의 제공은 미흡한 실정이다. 본 논문에서는 현재 검색기들이 제공하는 XML 문서에 대한 구조적인 검색 기능을 확장하여 XML 문서를 보다 효율적으로 검색하기 위하여 새로운 색인 기법을 제안하고, 데이터베이스 내에 저장된 XML문서에 대해 구조적인 검색과 이것을 바탕으로 문서를 재구성하고 재사용하는 기능을 수행할 수 있도록 새로운 질의어(TQL)을 설계하였다.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.2
• /
• pp.16-23
• /
• 2003

In most organizations, the relational DBMS was used for store and manage XML documents due to the pre-established relational DBMS. But, relational DBMS has some problems. They has the possibilities of informational loses in the process of mapping the structure of XML documents to RDB, and they require expensive cost to reflect all XML properties. Thus, this paper was intended to design and implement XML document management system which utilize O2 DBMS-object oriented DBMS in order to overcome the existing problem and reflect all XML Properties. The XML document management system purposed in this thesis has multiple function, such as the library service function for XML documents-check-in/check-out, versioning, user access management-, dynamic indexing and retrieval, and publishing function using style sheet.

• Journal of Intelligence and Information Systems
• /
• v.10 no.3
• /
• pp.27-37
• /
• 2004

XML has been proposed as a document standard for the representation and exchange of data on the WWW, and also becoming a standard for the search and reuse of scattered documents. When implementing a XML contents management system, special consideration should be imposed on how to model data and how to store the modelled data for effective and efficient management of the semi-structured data. In this paper, we proposed a new data model for the storage and search of XML document data. This proposed data model could represent both of data and structure views of XML documents, and be applied to the new data system for XML documents as well as the existing data systems.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.424-428
• /
• 2004

Study related to a system that saves a n document, and to search is consisting actively and has a lot of cases to have left emphasis in the function that these systems efficiently save a XML document and can search. Also, It has a table or the storage structure which was especially designed in order to save a XML document and can save structure information of a document in addition to contents of a XML document together and can efficiently do content retrieval of a XML document or a structure search with an early base. As for this paper, a design implemented the data which the many different kinds of database that had currently used had with you so that did recycling and shared conversion and this XML file in Web, and output can become a XML format through various interrace.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.155-164
• /
• 2005

WThe education information have been increased. Accordingly, the necessary of developing on education information metadata standards has been increased. By the reason, the Korea Education & Research Information Service developed KEM(Korea Educational Metadata) 2.0. And MPEG-7 was developed to describe metadata of multimedia data. In this paper, we developed a education information image retrieval system. This system used XML schema to accept education information image metadata. We integrated contents-based retrieval and a semantic-based retrieval to overcome there problems that content-based retrieval system can not support semantic-based retrieval and a semantic-based retrieval can not support content-based retrieval. As a results, we expect to handle metadata more efficiently.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.1
• /
• pp.87-100
• /
• 2004

XML has recently considered as a new standard for data presentation and exchange on the web, many researches are on going to develop applications and index mechanism to store and retrieve XML documents efficiently. In this paper, design a Main-Memory based XML storage system for efficient management of XML document. And propose structured retrieval of XML document tree which reduce the traverse of XML document tree using element type information included user queries. Proposed indexing mechanism has flexibilities for dynamic data update. Finally, for query processing of XML document include Link information, design a index structure of table type link information on observing XLink standards.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.7 no.4
• /
• pp.274-278
• /
• 2007

As XML becomes the standard of digital data exchange format we need to manage a lot of XML data effectively. Unlike tables in relational model XML documents are not structural. That makes it difficult to store XML documents as tables in relational model. To solve these problems there have been significant researches in relational database systems. There are two kinds of approaches: 1) One way is to decompose XML documents so that elements of XML match fields of relational tables. 2) The other one stores a whole XML document as a field of relational table. In this paper we adopted the second approach to store XML documents because sometimes it is not easy for us to decompose XML documents and in some cases their element order in documents are very meaningful. We suggest an efficient table schema to store only inverted index as tables to retrieve required data from XML data fields of relational tables and shows SQL translations that correspond to XML full-text retrievals. The functionalities of XML retrieval are based on the W3C XQuery which includes full-text retrievals. In this paper we show the superiority of our method by comparing the performances in terms of a response time and a space to store inverted index. Experiments show our approach uses less space and shows faster response times.