• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.4
• /
• pp.389-398
• /
• 2002

As XML has been proposed a standard format for organizing and exchanging data in the internet, many applications on managing XML data have been developed. Especially, there are many studies for storing XML documents. It is important to evaluate the performance for efficient storage techniques. In this work, we suggest an efficient technique for storing XML documents using an object-relational database model. We verify the efficiency of a new storage technique through the performance evaluation on XML storage techniques. The contributions of this paper is that we suggest an efficient storage technique using an existing data management model and evaluate the performance for storage techniques for XML documents including an new storage technique.

• The Journal of Society for e-Business Studies
• /
• v.14 no.1
• /
• pp.57-79
• /
• 2009

As the Web-based e-Business prevails, the volume of XML data on the Web is getting larger than ever. Although much research has been done on decomposing and storing XML data in RDB, which is now the most popular storage for XML, and on processing XML queries through their SQL counterparts, little attention was paid to how to alleviate the burden of storing massive volume of XML data. In this paper, we propose a hybrid method of storing XML data in RDB, whereby the unit of storage could be an XML subtree as well as an XML node. The part of XML data whose nodes were separately stored could be reformed into an XML subtree for storing when it gets rarely queried or less valuable for reference as time goes by. With this method, we designed and implemented a hybrid XML storage and query processing system, comparing it with the conventional system where an XML node is the only unit of storage. Through experiments, we compared storage efficiency and query processing performance, validating the effectiveness of our proposed system.

• Journal of KIISE:Databases
• /
• v.33 no.5
• /
• pp.551-562
• /
• 2006

XML query caching for XML database-backed Web applications began to be investigated recently. Despite its practical significance, efficiency of the storage schemes for cached query results has not been addressed. In this paper, we deal with the storage schemes for XML query cache. A fundamental problem that needs to be considered in designing an efficient storage structure for XML query cache is that there exist performance tradeoffs between the two major types of operations on a cached query result. The two are (1) retrieving the whole of it to return the query result and (2) updating just a small portion of it for its incremental refresh against the updates done to its source. We propose eight different storage schemes for XML query cache, which are categorized into three groups: (1) the schemes based on the plain text file, (2) the schemes based on the persistent DOM (PDOM) file, and (3) a scheme employing an RDBMS. We implemented all of them, and compared their performance with each other. We also compared our proposal with a storage scheme based on a current state-of-the-art XML storage scheme, showing that ours is more efficient.

• Journal of Korea Multimedia Society
• /
• v.9 no.8
• /
• pp.939-949
• /
• 2006

With the development of industry, product data management system is becoming more and more important. An expanded view of product definition function that include a bill of material and routing database, current and historical engineering data and specifications and engineering changes order history. PDM (Product Data Management) systems hold and manage such material as product specifications, plans, geometric models, CAD drawings and images. Furthermore, PDM enables companies producing complex products to spread product data in to the entire launch process. Especially, PDTnet XML Schema is an international standard for exchanging of PDM data. But PDTnet XML Schema differs from existing XML Schema in the way that its property of IDREF/IDREFS is irregular. Therefore it is important factor that. what do we use storage devices and storage techniques. We developed storage techniques and application supporting various query types and preserving PDTnet XML Schema using a relational database that guaranteeing the performance nowadays. In this paper, we will show that our storage techniques minimize repeated data and optimize query processing by using application comparison with storage techniques of existing XML Schema data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.877-895
• /
• 2010

The state-of-the-art techniques of storing XML data, modeled as an XML tree, are node-based in the sense that they are centered around XML node labeling and the storage unit is an XML node. In this paper, we propose a generalization of such techniques so that the storage unit is an XML subtree that consists of one or more nodes. Despite several advantages with such generalization, a major problem would be inefficiency in XPath processing where the stored subtrees are to be parsed on the fly in order for the nodes inside them to be accessed. We solve this problem, proposing a technique whereby no parsing of the subtrees involved in XPath processing is needed at all unless they contain the nodes of the final query result. We prove that the correctness of XPath processing is guaranteed with our technique. Through implementation and experiments, we also show that the overhead of our technique is acceptable.

• Journal of National Security and Military Science
• /
• s.2
• /
• pp.237-260
• /
• 2004

As the research work about XML based on the development of Internet and according to the information exchange standard is being carried out, the need of discovering new methods to store XML documents and manage them efficiently according to the frequency of large-capacity XML documents increases. Consequently, as a kind of back-end database system, XML storage systems such as RDBMS, OODBMS and Native XML DBMS etc. are coming forth in order to save XML documents. It is an urgent task to make comparisons among usage expense, function comparison storage, inquiry, and manage dimension for each DBMS. This paper makes an analysis and comparison of DTD-independent XML document access methods in RDBMS, OODBMS and Native XML DBMS for XML storage and management. After analyzing the advantages and disadvantages of each access method and comparing the function of typical commerce DBMS such as Oracle 8i, eXcelon and Tamino for finding the possibility of military applications, an another appropriate method to save XML documents is proposed as to find an implementation approach to save structural XML documents.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.1
• /
• pp.38-44
• /
• 2001

Nowadays, the study on XML as a standard method of exchange of information is active as Internet technology develops. This thesis designs and implements XML documents storage system using uniSQL/X in object-relational database. The system takes advantage of the merits of object-oriented databases, so that the structural information of XML documents can be effectively represented. The system uses split-storage method to allow frequent modifications of XML documents and suggests DTD-independent model so that it can store XML documents without DTD. And retrieval speed is improved by solving the issue of data duplication.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.2
• /
• pp.183-193
• /
• 2003

XML has emerged as the internet standard for information exchange among e-businesses and applications. Therefore, it becomes necessary to store XML documents in database for efficient management. This paper describes the design and implementation of XML documents storage and retrieval system based on object-relational database. The storage method first, decomposes XML document into Element, and then stores according to element types. The system also supports various search methods to retrieve XML documents from database.

• The Journal of the Korea Contents Association
• /
• v.6 no.4
• /
• pp.19-28
• /
• 2006

XML instances for purpose of information exchange are normally stored in the legacy relational database. Therefore, integrations with relational database are required for effective XML applications. To support these requirements, virtual decomposition storage or decomposition storage methods which save separates structures of instances to relational database have researched. However, these storage methods contain different information of schema structure and layers which has caused difficulties to process query during search operation as well as increased overheads due to duplicate savings for separate storages. Therefore, in this research, additional field of 'Eltype' has introduced to previous database schema structure to instance and schema structure, provide consistent level information and propose storage structure to map each field to schema field of relational database. As results, XML instance and structures can be stored together to minimize overheads and required storage-space. Also, synchronized storage layer structure provides easier processing of search query.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.5
• /
• pp.416-426
• /
• 2005

A B2Bi system needs a message storage subsystem that efficiently logs and searches XML messages which have been sent from orreceived by it. XML database systems and XML enabled relational databases systems are not adequate as a message storage system because of their expensiveness and excessiveness in functionality. Storage schemes that split XML messages into database records are also unacceptable because of either low performance or implementation hardness. In this paper, we propose a storage scheme that can be applied to implement a message storage system based on a relational database system. In this scheme, messages are examined only through the index fields that have been registered for each message types. Therefore, the proposed storage scheme cannot support such a powerful search facility like XQL, but it provides high performance message legging and restricted search facility. There are three alternative database schemas to store the index fields. This paper compares the advantages and disadvantages of the three schemas through experimental tests.