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

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

• The KIPS Transactions:PartD
• /
• v.13D no.2 s.105
• /
• pp.147-156
• /
• 2006

Event logging plays increasingly an important role in system and network management, and syslog is a de-facto standard for logging system events. However, due to the semi-structured features of Common Log Format data most studies on log analysis focus on the frequent patterns. The extensible Markup Language can provide a nice representation scheme for structure and search of formatted data found in syslog messages. However, previous XML-formatted schemes and applications for system logging are not suitable for semantic approach such as ranking based search or similarity measurement for log data. In this paper, based on ranked keyword search techniques over XML document, we propose an XML tree structure through a new data modeling approach for syslog data. Finally, we show suitability of proposed structure for semantic retrieval.

• Journal of KIISE:Software and Applications
• /
• v.27 no.2
• /
• pp.180-192
• /
• 2000

Recently, the component technology has played a main role in software reuse. It has changed the code-based reuse into the binary code-based reuse, because components can be easily combined into the developing software only through component interfaces. Since components and component users have increased rapidly, it is necessary that the users of components search for the most proper components for HTML among the enormous number of components on the Internet. It is desirable to use web-document-typed specifications for component specifications on the Internet. This paper proposes to use XML component specifications instead of HTML specifications, because it is impossible to represent the semantics of contexts using HTML. We also propose the XML context-search method based on XML component specifications. Component users use the contexts for the component properties and the terms for the values of component properties in their queries for searching components. The index structure for the context-based search method is the inverted file indexing structure of term-context-component specification. Not only an XML context-based search method but also a variety of search methods based on context-based search, such as keyword, search, faceted search, and browsing search method, are provided for the convenience of users. We use the 3-layer architecture, with an interface layer, a query expansion layer, and an XML search engine layer, of the search engine for the efficient index scheme. In this paper, an XML DTD(Document Type Definition) for component specification is defined and the experimental results of comparing search performance of XML with HTML are discussed.

• Journal of Internet Computing and Services
• /
• v.4 no.3
• /
• pp.15-22
• /
• 2003

Many information storage systems, such as database system, were needed to integrate much informations into one system and to provide mare voluminous lump of informations. But as the size of information system becomes larger, the responded result size of existing keyword based searching system might be too large and couldn't do the exact search which the user intends to. In this study, we proposed a paper searching method which uses RDF semantic. For this, we analyzed the structural forms of the tit1e of research papers and reconstructed them into RDF/XML. When we use these RDF descriptions of the titles to search papers, we could get more precise and accurate results than keyword based searching method.

• Proceedings of the CALSEC Conference
• /
• 2005.03a
• /
• pp.189-194
• /
• 2005

Many studies have been conducted to classify documents, and to extract useful information from documents. However, most search engines have used a keyword based method. This method does not search and classify documents effectively. This paper identifies structures of XML document based on the fact that the XML document has a structural document using a set theory, which is suggested by Broder, and attempts a test for clustering XML document by applying a k-nearest neighbor algorithm. In addition, this study investigates the effectiveness of the clustering technique for large scaled data, compared to the existing bitmap method, by applying a test, which reveals a difference between the clause based documents instead of using a type of vector, in order to measure the similarity between the existing methods.

• Journal of Internet Computing and Services
• /
• v.9 no.1
• /
• pp.103-113
• /
• 2008

Vast amount of XML documents raise interests in how they will be used and how far their usage can be expanded, This paper has two central goals: 1) easy and fast retrieval of XML documents or relevant elements; and 2) efficient and stable management of large-size XML documents, The keys to develop such a practical system are how to segment a large XML document to smaller fragments and how to store them. In order to achieve these goals, we designed SCOF(Service-centric Object Fragmentation) model, which is a semi-decomposition method based on conversion rules provided by XML database managers. Keyword-based search using SCOF model then retrieves the specific elements or attributes of XML documents, just as typical XML query language does. Even though this approach needs the wisdom of managers in XML document collection, SCOF model makes it efficient both retrieval and management of massive XML documents.

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

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.379-382
• /
• 2008

저장하고 표현해야 할 정보의 종류가 많아지고 그 양이 증가함에 따라 사용자는 자신이 원하는 정보를 찾기 위해 정보 검색의 과정을 수행한다. 하지만 전통적인 검색 방법은 해당 사용자가 이미 정보의 표현 방법, 즉 스키마를 모두 알고 있다는 가정 하에 진행되어 진다. 키워드 검색 기법은 사용자에게 내부적인 스키마 구조를 숨기고 단지 몇 개의 키워드로 사용자에게 원하는 정보를 검색해 준다. 본 논문에서는 XML 문서 안의 정보를 찾는 새로운 키워드 검색 기법을 제안한다. 제안하는 방법으로 각 XML 문서 원소가 표현하는 의미 정보를 최대한 활용하여 사용자가 원하는 정보를 검색해 줄 수 있는 인덱스를 구축하고 이를 통해 사용자가 알고자 하는 검색의 목표가 무엇인지 그 의미도 파악할 수 있도록 지원한다. 구축된 인덱스를 바탕으로 검색에 수행되는 XML 원소 비교의 횟수를 줄여서 전체 검색 성능을 향상 시킬 수 있도록 한다.

• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.595-598
• /
• 2007

Vast amount of XML documents raise interests in how they will be used and how far their usage can be expanded. This paper has two central goals: 1) easy and fast retrieval of XML documents or relevant elements; and 2) efficient and stable management of large-size XML documents. The keys to develop such a practical system are how to segment a large XML document to smaller fragments and how to store them. In order to achieve these goals, we designed SCOF(Service-centric Object Fragmentation) model, which is a semi-decomposition method based on conversion rules provided by XML database managers. Keyword-based search using SCOF model then retrieves the specific elements or attributes of XML documents, just as typical XML query language does. Even though this approach needs the wisdom of managers in XML document collection, SCOF model makes it efficient both retrieval and management of massive XML documents.