• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10b
• /
• pp.16-18
• /
• 2004

현재 ebXML과 웹 서비스가 기업간 전자상거래(B2B)에 있어서 두 축을 이루고 있으며 각각 ebXML 레지스트리와 UDDI를 이용하여 전자상거래에 필요한 정보를 저장 관리하고 있다. ebXML 레지스트리와 UDDI는 이질적인 시스템 구조물 갖고 있기 때문에 원하는 서비스를 검색하고자 할 경우. 각각의 레지스트리에 의존적인 방식으로 접근을 해야 하는 단점이 있다. 또한 이 두 레지스트리는 키워드 기반의 검색만을 지원하므로 검색의 지원범위에 한계가 있다. 이물 해결하기 위해 본 논문에서는 OWL-S를 이용하여 레지스트리 공통모델을 정의하고, 온톨로지를 구축하여 시멘틱 검색이 가능하도록 한다

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10b
• /
• pp.145-147
• /
• 2004

웹 상에서의 자료 검색 방법이 기존의 키워드 검색이나 단순 내용 기반 검색 방법에서 다양한 형태의 의미기반 검색으로 발전하고 있다. 멀티미디어 데이타를 효율적으로 저장, 검색하기 위해서는 표준화된 데이타 구조가 필요하다. 본 논문에서는 멀티미디어 자료 중에서 이미지의 의미기반 검색을 지원하기 위해 기존의 메타데이타 표준안을 반영한 확장성 있는 통합 이미지 메타데이타 구조를 정의하였다. 또한 통합 이미지 메타데이타를 웹 상에서 상호 교환하기 위해 XML 문서 형태로 표현하였으며, 이를 위해 VRA와 통합 이미지 메타데이타에 대한 XML 스키마를 정의하고 통합 이미지 메타데이타 XML 문서 생성기를 작성하였다

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.710-720
• /
• 2004

As XML documents have much richer information than plain texts, we can perform very elaborated, fine-grained search which was difficult in past years. However, as the cost of finer grained element level search is very high, the processing overhead has become a new challenge. We propose an inverted index structure called PIX, which reduces the number of elements processed by partitioning elements according to their match potentiality. We choose a base level and partition elements according to whether they have possibility of having a common ancestor higher than the level. We also propose partition merging technique by which we can get same results as unpartitioned case. Our experimental results show that the index partitioning strategy can reduce processing time considerably.

• The KIPS Transactions:PartD
• /
• v.17D no.2
• /
• pp.103-110
• /
• 2010

Recently, many XML document management systems using the advantage of RDBMS have been actively developed for the storage, processing and retrieval of XML documents. However, fractional pattern-matching query such as the LIKE operations cannot take the advantage of the index of RDBMS because these operations have deteriorated retrieval performance through its inefficient comparison processing. The hierarchical XML storage technique which stores XML documents in RDBMS efficiently, and the path inverted index technique are proposed in this paper. It regards the element of an XML document as a keyword, and focuses on organizing a posting file with path identifiers and sequences to reduce the retrieval time of path based query. Through simulations, our methods have shown about 60% better performance than the conventional method using RDBMS in searching.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11c
• /
• pp.1339-1342
• /
• 2003

XML이 인터넷상에서 디지털 정보를 표현하고 교환하기 위한 표준이 되어감에 따라 최근까지 XML을 저장하고 검색하기 위한 역인덱스 기법에 대한 연구가 활발히 진행되고 있다. 본 논문에서는 XML 전문 검색을 위한 새로운 역인덱스 구조를 제안한다. 기존에 연구된 역인덱스 기법을 통한 키워드 검색 기능을 더욱 보완하고 최근에 W3C에서 새로운 기능으로 추가된 전문 검색 기능을 구현한다.

• The Journal of Society for e-Business Studies
• /
• v.13 no.2
• /
• pp.213-223
• /
• 2008

The efficient discovery of services from a large scale collection of services has become an important issue[7, 24]. We studied a syntactic method for Web service discovery, rather than a semantic method. We regarded a service discovery as a retrieval problem on the proprietary XML formats, which were service descriptions in a registry DB. We modeled services and queries as probabilistic values and devised similarity-based retrieval techniques. The benefits of our way are follows. First, our system supports ranked service retrieval by keyword search. Second, we considers both of UDDI data and WSDL definitions of services amid query evaluation time. Last, our technique can be easily implemented on the off-theshelf DBMS and also utilize good features of DBMS maintenance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.11
• /
• pp.2133-2138
• /
• 2017

The analysis of existing XML documents and other documents was centered on words. It can be implemented using a morpheme analyzer, but it can classify many words in the document and cannot grasp the core contents of the document. In order for a user to efficiently understand a document, a paragraph containing a main word must be extracted and presented to the user. The proposed system retrieves keyword in the normalized XML document. Then, the user extracts the paragraphs containing the keyword inputted for searching and displays them to the user. In addition, the frequency and weight of the keyword used in the search are informed to the user, and the order of the extracted paragraphs and the redundancy elimination function are minimized so that the user can understand the document. The proposed system can minimize the time and effort required to understand the document by allowing the user to understand the document without reading the whole document.

• Journal of the Korean Society for information Management
• /
• v.19 no.3
• /
• pp.91-110
• /
• 2002

Recently, to overcome the limit of keyword based retrieval system, the study based structured document has been studied. But it is hard for structured retrieval system to adapt a real service, in this paper, we propose a method of retrieval mechanism for the fulltext of XML documents. We explain DTD of XML based report, extracting navigation information and planing to adapt the retrieval system for article retrieval. Using the fulttext retrieval scheme, suggested system can be an alternative plan of professional structured based retrieval system.

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

• Journal of Internet Computing and Services
• /
• v.6 no.2
• /
• pp.99-115
• /
• 2005

Extensible Markup Language (XML) is an Internet standard that is used to express and convert data, In order to find the necessary information out of XML documents, you need a search system for XML documents, In this research, we have developed a search system that can find documents that matches the structure and content of a given XML document, making the best use of XML structure, Search metrics take account of the similarity in tag names, tag values, and the structure of tags, After a search, the system displays the ranked results in the order of aggregate similarity, Three methods of query are provided: keyword search which is conventional; search with tag names and their values; and search with XML documents, These three methods enable users to choose the method that best suits their preference, resulting in the increase of the usefulness of the system.