• Journal of the Korea Computer Industry Society
• /
• v.3 no.2
• /
• pp.167-178
• /
• 2002

XML documents used for exchanging structured documents between heterogeneous distributed systems are spreading among B2B and the industrial world rapidly. This condition brings an object-oriented visualization tool for modeling XML documents. It is hard to apply for DTD - the rule for declaring document type, which is employed in XML, to various industrial field. Thus, W3C announced Recommendation for XML Schema - the rule for declaring new document type which is adaptable to XML and satisfy to user. Document Type which has high reusability and flexibility can be defined owing to that XML Schema is designed by utilization of Object-Oriented-Modelling technique(UML). This document is proposed the specification and an algorithm for mapping XML Schema to UML.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.11a
• /
• pp.195-203
• /
• 2003

With the spread of interment, the digitalization and knowledge-based information are in progress. Specially, numerous users make the various works and use the services on the web. For the most part, these works make use of the XML. The XML shines the reusing of the Documents because it is separated from contents and styles. Also, it can re-define the logic structure of the Document for requirement of the developer. However, the XML document's size is much larger than common text document because it basically handles the document type and adds numerous tags for representing structure of the document. To utilize the limited storage of Palmtop, PDA and so on, it is necessary to compress and handle the documents efficiently. Recently, the compression techniques for efficiently handling and compressing the XML documents are in progress to solve this problem. But the existing research doesn't support the query processing for that. In this paper, we design and implement the XML compression algorithm that compresses the XML document and processes the quay of compressed XML document faster and mote effciently than the previous techniques.

• The KIPS Transactions:PartD
• /
• v.9D no.6
• /
• pp.999-1008
• /
• 2002

XML is emerging as a standard data format to exchange and to present data on the Web. There are increasing needs to efficiently store and to query XML data. In this paper. we propose a new schema transformation algorithm based on a common structure extracting technique from XML documents. The common structure is shared by all XML documents referenced by DTD and the uncommon structure is ununiformly appeared on all XML documents referenced by DTD. Based on the extracted common and uncommon structures, we transform XML DTD into relational database schema. We conduct a performance evaluation based on the number of the generated tables, the size of the record, query processing time and the number of joins on the query. The performance of our algorithm is compared with the existing algorithms, then in most cates, our algorithm is better than the existing ones with respect to the number of the generated tables and appearance of NULL values in the tables.

• Journal of Korea Multimedia Society
• /
• v.11 no.4
• /
• pp.415-422
• /
• 2008

With the increasing use of XML, considerable research is being conducted on the XML document management systems for more efficient storage and searching of XML documents. Depending on the base systems, these researches can be classified into object-oriented DBMS (OODBMS) and relational DBMS (RDBMS). OODBMS-based systems are better suited to reflect the structure of XML-documents than RDBMS based ones. However, using an XML parser to map the contents of documents to relational tables is a better way to construct a stable and effective XML document management system. The proposed X-Binder system uses an RDBMS-based inverted index; this guarantees high searching speed but wastes considerable storage space. To avoid this, the proposed system incorporates a path combining module agent that combines paths with sibling relations, and stores them in a single row. Performance evaluation revealed that the proposed system reduces storage wastage and search time.

• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.327-338
• /
• 2001

The view can provide the user an appropriate portion of the database through data integration and filtering. Views can be materialized for query performance improvement, and in that cse, their consistency needs to be maintained against the updates of the underlying data. They can be either recomputed or incrementally refreshed by reflecting the relevant updates. Since XML could represent the structural information of the documents, for the XML materialized views, new techniques that differ from the previous ones for incrementally refreshing the relational views are required. In this paper, we propose a framework of XML materialized view management where the XML view derived from the underlying XML documents are materialized and incrementally refreshed against the updates of the underlying documents.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.3
• /
• pp.332-340
• /
• 2003

XML is an emerging internet standard for data representation and exchange on the web. Recently, many researches on storing XML documents are in progress. Since XML documents have an implicit semantic schema, it is difficult to store XML data into a DBMS or File System. This paper introduces XDOM, object repositories for the DOM object, which stores an object for persistency support. As XDOM does not require the burdensome design of a fixed schema unlike the legacy DBMS, can store schema-less XML documents. And it can help XML applications to access the DOM object transparently from the object repositories below memory. XDOM introduced in this paper is implemented in pure Java and evaluated using experiments.

• Journal of KIISE:Databases
• /
• v.31 no.1
• /
• pp.72-81
• /
• 2004

Theses days, a number of data over the Internet are represented using XML because of a virtue of XML. In proportion to the increase of XML data, query processing techniques are required that support quickly and efficiently the diverse queries to search the useful information on XML documents. But, up to now, the researches handling queries for XML data are methodologies focusing on how to process regular path expressions. Therefore, we have developed a new genealogy-based indexing technique to solve various queries such as not only regular path expression but also simple path expression, path expression referencing other elements, and so on. Also, we have applied this technique on object-relational model and evaluated the performance for many documents and various query types. The result shows improved performance in comparison with the other storage techniques.

• Journal of KIISE:Databases
• /
• v.30 no.5
• /
• pp.532-539
• /
• 2003

The paper proposes a pre-processing method for efficient processing of XML queries in information retrieval systems with a large amount of XML documents. For the pre-processing, we use a signature-based approach. In the conventional (flat document-based) information retrieval systems, user queries consist of keywords and boolean operators, and thus signatures are structured in a flat manner. However, in XML-based information retrieval systems, the user queries have the form of path query. Therefore, the flat signature cannot be effective for XML documents. In the paper, we propose a structured signature for XML documents. Through experiments, we evaluate the performance of the proposed method.

• Journal of Korea Multimedia Society
• /
• v.6 no.2
• /
• pp.309-318
• /
• 2003

XML documents are widely used for exchanging information in the distributed computing environment. Here, actual information contained in the document can only be interpreted with the provision of a proper DTD. However, XML documents collected from the web nay not always be accompanied by corresponding DTD, so that it may not be easy to extract information from such sources. In this study, we reverse construct a DTD from DTU-unknown XML sources. We then use the DTD to extract information from XML inputs and to store it into the underlying DB. The DTD construction module developed is designed in such a way that, it scans input XML files in 1-path, where most other implementations use 2-path approach. The information extraction module provides clean Java programming interfaces as well, so that it can be easily integrated with other web applications.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.2
• /
• pp.109-122
• /
• 2003

As XML documents become popular in the World Wide Web, a lot of research is being done on XML storage systems that store and manage XML documents using existing DBMSS. However, most of them have been done in the context of relational DBMSS rather than object-relational DBMSS, which have more powerful modeling capability than relational ones. In this paper, we design and implement an XML storage system, ODYSSEUS/XMLStore, for the ODYSSEUS object-relational DBMS that has been under development at KAIST. First, we analyze the mapping from the structure of XML documents to the relational or object-relational database schema. Second, we propose a method for describing the mapping analyzed using a standard language, XML Schema. Third, we propose a storage structure for storing the mapping information specified by the users in the database. Fourth, we propose detailed algorithms for storing XML documents in the relational or object-relational database based on the mapping information provided by the users.