• Journal of Industrial Technology
• /
• v.21 no.A
• /
• pp.141-146
• /
• 2001

XML is fast emerging as the dominant standard to represent and exchange data in the Web. As the amount of data available in the Web has increased dramatically in recent years, the data resides in different forms ranging from semi-structured data to highly structured data in relational database. As semi-structured data will be represented by XML, XML will increase the ability of semi-structured data. In this paper, we propose an idea for extracting schema in XML document using DTD.

• The KIPS Transactions:PartD
• /
• v.9D no.2
• /
• pp.297-306
• /
• 2002

This paper handles the design and implementation of the system for transforming the XML document bated on XML Schema being different in syntax but similar in logic, with using structured differences analysis. In the system, the merge data is generated from the source and destination documents by utilizing data registry and structured differences analysis, and then XML document is generated from the generated merge data. The XML document transformation system is designed that transformation process to the present application system from the different application system gains advantage in the aspect of time, cost, and reliability. The implementation environment of the system is that it is run on IBM compatible PC and it is developed using the software of visual basic 6.0 with the Platform of Windows 2000.

• 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 KIISE:Databases
• /
• v.34 no.5
• /
• pp.465-472
• /
• 2007

With the recent proliferation of the use of semi-structured data such as XML, it becomes more important to efficiently store and manage the semi-structured data. The XML data can be logically modelled as a rooted tree e.g., the DOM tree. In order to process a query on the XML data, we traverse the tree structure. In this paper we present an algorithm that places the XML data to disk blocks. The proposed algorithm assigns a number to each node of the tree in a bottom-up fashion. Then, the nodes are allocated to disk blocks using the assigned number. The proposed algorithm does not need access pattern information, and provides good performance for any access pattern. The characteristics of the proposed method are presented with analysis. Through experiments, we evaluate the performance of the proposed method.

• Proceedings of the IEEK Conference
• /
• 2000.06c
• /
• pp.71-74
• /
• 2000

New methods for storing and retrieving semi-structured data such XML documents has been recently studied. In this paper, we concern querying of XML data stored in relational tables. We first describe a method of querying XML documents using Oracle XDK, especially XSQL Servlet. We then apply the method to XML documents describing book information.

• The Journal of Society for e-Business Studies
• /
• v.8 no.1
• /
• pp.85-102
• /
• 2003

Nowadays an information exchange on XML such as B2B electronic commerce is spreading. Therefore the systematic and stable management mechanism for storing the exchanged information is needed. For this goal there are many research activities for connection between XML application and relational database. But because XML data have hierarchical structures and relational database can store only flat-structured data, we need to make the conversion rule which changes the hierarchical architecture to 2-dimensional information. Accordingly the modeling methodology for storing each structured information in relational database is needed. In this paper, we introduce a XML modeling methodology to design W3C XML schema using UML and we propose a unified design methodology for relational database schema to store XML data efficiently in relational databases. In the second place, in order to verify objectivity of a unified design methodology. By the way of Ronald Bourret, First we introduce the method of the transformation from XML schema to object model and second we translate object model into relational database schema. Therefore we show the mutual consistency between those consequence, and so can verify a unified design methodology.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06a
• /
• pp.250-252
• /
• 2006

Web technologies are gaining increased importance in automation and control systems. However, the choice of Web technologies depends on the use cases in the application environment. In industrial systems, the data can be got not only from many different field systems and devices but also from different OPC (OLE for Process Control) Servers. Current OPC Client might be able to read simple data from OPC Server, but there are some problems to get structured data and to exchange structured information between collaborating applications. Therefore, OPC Foundation has defined interfaces to OPC XML-DA (OPC XML Data Access) and OPC Complex Data that aim to solve those problems. The OPC XML-DA can facilitate the exchange of plant data across the internet, and upwards into the enterprise domain. In addition, the OPC Complex Data will extend the OPC DA specification to allow the OPC Client to read and decode any type of data from measurement and control systems on the plant floor. This paper will describe the concept of OPC XML-DA and OPC Complex Data. And then it proposes a mechanism to implement the OPC Complex Data into OPC XML-DA Server. Additionally, the paper also discusses the security aspects.

• The Journal of Information Systems
• /
• v.14 no.3
• /
• pp.37-47
• /
• 2005

Mining of association rules is to find associations among data items that appear together in some transactions or business activities. As of today, algorithms for association rule mining, as well as for other data mining tasks, are mostly applied to relational databases. As XML being adopted as the universal format for data storage and exchange, mining associations from XML data becomes an area of attention for researchers and developers. The challenge is that the semi-structured data format in XML is not directly suitable for traditional data mining algorithms and tools. In this paper we present an encoding method to encode XML tree-nodes. This method is used to store the XML data in Value Table and Transaction Table that can be easily accessed via indexing. The hierarchical relationship in the original XML tree structure is embedded in the encoding. We applied this method to association rules mining of XML data that may have missing data.

• Journal of Information Technology Applications and Management
• /
• v.14 no.2
• /
• pp.117-127
• /
• 2007

Using an exchange standard, we can design an open architecture for the interchange of decision models and data. XML (eXtensible Markup Language) provides a general framework for creating such a standard. Although XML -based model representation languages such as OOSML were proposed, they are partly limited in expression capability, flexibility, generality, etc. This paper proposes a new method for expressing and sharing decision models and data based on XBRL (eXtensible Business Reporting Language), which is a XML language specialized in business reporting. We have developed a XBRL taxonomy for decision models with the concepts and relationships of a representative modeling framework, SM (Structured Modeling). The method allows for expressing data as well as decision models in a consistent and flexible manner. Diverse dependencies between components of SM models can also be affluently expressed.

• Journal of KIISE:Databases
• /
• v.31 no.3
• /
• pp.320-330
• /
• 2004

Query languages for XML use paths in a data graph to represent queries. Actually, paths in a data graph are used as a basic constructor of an XML query. User can write more expressive Queries by using Patterns (e.g. regular expressions) for paths. There are many identical paths in a data graph because of the feature of semi-structured data. Current researches for indexing XML utilize identical paths in a data graph, but such an index can grow larger than source data graph and cannot guarantee efficient access path. In this paper we propose a partitioning technique that can partition all the paths in a data graph. We develop an index graph that can find appropriate partitions for a path query efficiently. The size of our index graph can be adjusted regardless of the source data. So, we can significantly improve the cost for index graph traversals. In the performance study, we show our index much faster than other graph based indexes.