• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10b
• /
• pp.161-163
• /
• 2000

인터넷 문서의 표준 사양인 XML 문서가 늘어나면서 XML 문서를 효과적으로 관리고 검색하기 위한 시스템이 개발되고 있다. 그러나 정형화된 질의언어를 사용한 XML 문서의 검색 방법은 질의언어의 구조를 이해하고 사용법을 숙지해야 하는 어려움이 있어 일반 사용자에게는 적합하지 않다. 따라서 사용자가 쉽게 사용할 수 있으면서도 정확한 결과를 가지는 시스템이 요구된다. 본 논문에서는 XML 문서를 검색하기 위해 자연어로 질의를 입력하면 이를 XML 구조 검색을 위한 XQL 언어로 자동 변환해 주는 시스템을 제안한다. 제안한 시스템은 자연어를 이용하기 때문에 사용하기가 쉽고 XML 문서 구조가 변경되어도 쉽게 확장할 수 있는 장점을 가진다.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2003.12a
• /
• pp.86-90
• /
• 2003

XML(extensible Markup Language)는 웹상에서 문서를 표현하고 교환하기 위한 표준으로 자리 잡았다. XML 문서는 자체적으로 민감성의 등급이 다른 정보를 포함할 수 있는 구조를 가지고 있으므로 XML 문서에 대한 특정 사용자 그룹의 선택적인 접근 및 공유를 위한 방법이 반드시 필요하다. 이를 위해서는 XML문서에 대한 접근제어 정책을 규정하고 수행하기 위한 방법과 메커니즘이 요구된다. 또한, XML 문서에 사용되는 접근제어 메커니즘은 사용자가 소유하고 있는 권한부여 정보에 의존하여 문서의 안전하고 선택적인 배포가 가능해야 한다. 본 논문에서는 XML 문서의 안전하고 선택적인 접근문제를 해결하기 위하여 RBAC를 응용한 메커니즘을 제안한다.

• Journal of KIISE:Software and Applications
• /
• v.29 no.6
• /
• pp.367-376
• /
• 2002

XML allows users to define elements using arbitrary words and organize them in a nested structure. These features of XML offer both challenges and opportunities in information retrieval and document management. In this paper, we propose a new methodology for computing similarity considering XML semantics - meanings of the elements and nested structures of XML documents. We generate extended-element vectors, using thesaurus, to normalize synonyms, compound words, and abbreviations and build similarity matrix using them. And then we compute similarity between XML elements. We also discover and minimize XML structure using automata(NFA(Nondeterministic Finite Automata) and DFA(Deterministic Finite automata). We compute similarity between XML structures using similarity matrix between elements and minimized XML structures. Our methodology considering XML semantics shows 100% accuracy in identifying the category of real documents from on-line bookstore.

• The KIPS Transactions:PartB
• /
• v.14B no.1 s.111
• /
• pp.23-32
• /
• 2007

Nowadays, XML has been favored by many companies internally and externally as a means of sharing and distributing data, due to its open-architectural structure. XML-GL, a graphical query language for document has the advantage of containing both structuring and defining of itself. By incorporating UML an XML document can become object-oriented and can be represented by graphical means. This paper proposes a XML-GL query modeling solution by using UML class diagrams. In order for the modeled objects to be properly restricted, the Object Constraint Language has been defined. This process converts XML documents into Object-Oriented data and combined with UML class diagrams, searches for XML documents can be increased.

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

• Journal of KIISE:Databases
• /
• v.33 no.4
• /
• pp.423-436
• /
• 2006

In recent years, publish-subscribe (pub-sub) systems based on XML document filtering have received much attention. In a typical pub-sub system, subscribing users specify their interest in profiles expressed in the XPath language, and each new content is matched against the user profiles so that the content is delivered only to the interested subscribers. As the number of subscribed users and their profiles can grow very large, the scalability of the system is critical to the success of pub-sub services. In this paper, we propose a novel scalable filtering system called FiST(Filtering by Sequencing Twigs) that transforms twig patterns expressed in XPath and XML documents into sequences using Prufer's method. As a consequence, instead of matching linear paths of twig patterns individually and merging the matches during post-processing, FiST performs holistic matching of twig patterns with incoming documents. FiST organizes the sequences into a dynamic hash based index for efficient filtering. We demonstrate that our holistic matching approach yields lower filtering cost and good scalability under various situations.

• The KIPS Transactions:PartB
• /
• v.16B no.1
• /
• pp.71-78
• /
• 2009

For more effective index extraction and index weight determination, studies of extracting indices are carried out by using document content as well as structure. However, most of studies are concentrating in calculating the importance of context rather than that of XML tag. These conventional studies determine its importance from the aspect of common sense rather than verifying that through an objective experiment. This paper, for the automatic indexing by using the tag information of XML document that has taken its place as the standard for web document management, classifies major tags of constructing a paper according to its importance and calculates the term weight extracted from the tag of low weight. By using the weight obtained, this paper proposes a method of calculating the final weight while updating the term weight extracted from the tag of high weight. In order to determine more objective weight, this paper tests the tag that user considers as important and reflects it in calculating the weight by classifying its importance according to the result. Then by comparing with the search performance while using the index weight calculated by applying a method of determining existing tag importance, it verifies effectiveness of the index weight calculated by applying the method proposed in this paper.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.943-946
• /
• 2006

XML is the most widely used document format by advantage that self-contained for platform. So, currently the most used among other document format. but XML appeared new problem that memory and transmission. And that be used in environment a request restriction memory and fast transmission as like mobile field. Although discussion of XML binarization is going on progress. And fast Infoset configuration using XML Information Set is receiving attention that a way to lower file size of hold down a existing usage. In this paper, we designed of module using fast Infoset and PER among ASN.1 Encoding Rule for XML binarization. And we implementation of encoder constructed interlace by stage of translation from XML into binary XML.

• The KIPS Transactions:PartD
• /
• v.12D no.5 s.101
• /
• pp.781-788
• /
• 2005

MTF message is the normalized and standardized format which is used in the time when it tries to transmit data to other systems or exchanges needed information in defense message systems. XML can support variety of search functionality and is estimated to be the best way from the view of efficient presentation and exchange in internet based environment, based on advantage which is independent of hardware and software. US army brought in XML-MTF combining with XML based technology, but we do not contain such a MTF system, and necessity of MTF is increasing for combined operation between ROK and US as a lot of C4I system were transferred to Web based systems. In this paper, we make analysis of fundamental structure, organization of paragraph, witting regulation of MTF message. We present the rule of naming element and fundamental mapping rule for transformation of its XML based on it. Also, we prove that MTF message can be transformed to XML document by trying to transforming sample documents to XML document applying presented mapping rule, creating MTF message based on it and implement program which can automatically transform them to XML-MTF.

• IE interfaces
• /
• v.17 no.3
• /
• pp.330-337
• /
• 2004

Since XML (eXtensible Markup Language) was highlighted as an information interchange format, there is an increasing demand for incorporating XML with databases. Most of the approaches are focused on RDB (Relational Databases) because of legacy systems. But these approaches depend on the database system. Countless researches are being focused on DTD (Document Type Definition). However XML Schema is more comprehensive and efficient in many perspectives. We propose a meta-model for XML Schema that is independent of the database. There are three processes to build our meta-model: DOM (Document Object Model) tree analysis, object modeling and storing object into a fixed DB schema using model mapping approach. We propose four mapping rules for object modeling, which conform to the ODMG (Object Data Management Group) 3.0 standard. We expect that the model will be especially useful in building XML-based e-business applications.