• Proceedings of the Korea Association of Information Systems Conference
• /
• 2001.12a
• /
• pp.64-82
• /
• 2001

HTML revolutionized the way we specify the appearance of data on the Internet. Today, XML (the eXtensible Markup Language) is changing the way we specify the meaning of data. XML, lets document authors define their own markup tags and attribute names to assign meaning to the data elements in the document. Further, XML elements can be nested and include references to indicate data relationships, as Listing One. Unlike HTML, XML markup tags do not describe how to render the data. Rather, they provide descriptions of data, allowing software to understand the meaning of the data automatically For publishing, instead, XSL, the eXtensible Stylesheet Language as a separate language , is in charge of specifying the presentation of XML documents. The purpose of this study is to discover how to transform your organizations relational data into potential e-commerce, business-to-business, and web application with XML and XSL documents. For this purpose, the literature survey, first of all, was undertaken to understand the basic structures of XML documents. Second, one case implementation was performed to understand how to transform Access 2002 XML Files into HTML with XSLTand VB script. The results come out to be successful, more or less. But the limitations of it still exist. One immediate limitation is that XML documents are essentially tree structure, as dictated by the nesting of elements. However, relational database tables are two dimensional matrix structure. In addition, real-world data often is graph structured-a single data element may be referenced in multiple ways. However, this study is useful for understanding how to convert relational database into XML documents and to publish them using XSL or VB script.

• The KIPS Transactions:PartD
• /
• v.10D no.1
• /
• pp.13-22
• /
• 2003

Recently, as the Importance of the management on internet documents has highly increased, the research of an XML repository system has been actively made to store, retrieve and manage large XML documents. The version management for XML documents is required in the XML applications such as patent documents, software design and system manual that the modified documents have to be managed. In this paper, we propose a data model based on a fragmentation model that supports document versioning. We also design and implement an XML repository system supporting document versioning. It is shown through Performance evaluation that our system outperforms the existing repository system.

• Journal of Korea Multimedia Society
• /
• v.5 no.1
• /
• pp.105-113
• /
• 2002

XML documents, which are becoming new standard for expressing and exchanging data in the Internet, don't have defined schema. It is not adequate to directly apply XML documents to the existing SQL or OQL. Research on how to extract schema for XML documents and query language is going on actively. Fer users' query, the results could be too many or too less. It is important to give the users adequate results. This paper suggests the way to extract many levelized schema according to the frequency of element occurrence in XML documents. The Schema can be reduced or extended to correspond to the users'query more flexibly.

• Journal of Internet Computing and Services
• /
• v.10 no.3
• /
• pp.141-150
• /
• 2009

XML is increasingly important in data exchange and information management. A large amount of efforts have been spent in developing efficient techniques for accessing, querying, and storing XML documents. In this paper, we propose a new method to cluster XML documents efficiently. A new prepresentative path called a virtul path which can represent both the structure and the contents of a XML document is proposed for the feature of a XML document. A method to apply the well known hierarchical clustering techniques to the representative paths to cluster XML documents is also proposed. The experiment shows that the true clusters are formed in a compact shape when a virtual path is used for the feature of a XML document.

• Journal of Information Technology Services
• /
• v.7 no.3
• /
• pp.145-157
• /
• 2008

The existing XML storage methods which use relational data model, usually store path information for every node type including literal contents in order to keep the structural information of XML documents. Such path information is usually maintained by an inverted index to efficiently process XPath queries for large XML documents. In this study, We propose an improved approach that retrieve information from the large volume of XML documents stored in a relational database, while using a segment-based inverted index for path searches. Our new approach can reduce the number of searching an inverted index for getting target path information. We show the effectiveness of this approach through several experiments that compare XPath query performance with the existing methods.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2S
• /
• pp.711-720
• /
• 2000

BADA-IV/XML is a system designed specifically for managing XML. Documents and is essential to various electronic document applications as a fundamental system. BADA-IV/XML supports all of aspects of data model, querying and manipulation operations for managing XML documents. This paper provides an overview of these aspects of the BADA-IV/XML, as well as defines schema classes for stroing, querying and maintaining hierarchical semantics of multimedia documents and structural semantics of complex documents linked with each other, Also a multimedia document query language is designed and implemented to support essential operations for efficient searching and managing multimedia documents. Finally, some simulation results show the performance of the paged VF(Virtual Fragmentation) model and the search model using element's identifier as compared with a general model.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.1287-1290
• /
• 2011

Because of the rapid development of internet, there are more and more documents stored by the XML-based format. When there is a great deal of XML documents, how to get the valuable Information is an important subject. This paper proposes an effective XML document search method to search text contents and structures of XML documents. We build the keyword matrix of text contexts and structure matrixes of structures in XML documents to improve the efficiency of query time. When there is a great deal of XML documents, the search method we propose can improve much efficiency of query time.

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

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.7
• /
• pp.1599-1607
• /
• 2015

Recently, researches have been developing efficient techniques for accessing, querying, and managing XML documents which are frequently used in the Internet. In this paper, we propose a parent-child matrix to cluster XML documents efficiently. A parent-child matrix analyzes both the content and structural features of an XML document. Each cell of a parent-child matrix has either the value of a node in an XML tree or the value of a child node, where a parent-child relationship exists in the XML tree. Then, the similarity between two XML documents can be measured by the similarity between two corresponding parent-child matrices. The experiment shows that our proposed method has good performance.

• The KIPS Transactions:PartD
• /
• v.14D no.2
• /
• pp.169-180
• /
• 2007

This paper discusses a new unsupervised XML document clustering technique based on the function transform and FFT(Fast Fourier Transform). An XML document is transformed into a discrete function based on the hierarchical nesting structure of the elements. The discrete function is, then, transformed into vectors using FFT. The vectors of two documents are compared using a weighted Euclidean distance metric. If the comparison is lower than the pre specified threshold, the two documents are considered similar in the structure and are grouped into the same cluster. XML clustering can be useful for the storage and searching of XML documents. The experiments were conducted with 800 synthetic documents and also with 520 real documents. The experiments showed that the function transform and FFT are effective for the incremental and unsupervised clustering of XML documents similar in structure.