• The KIPS Transactions:PartC
• /
• v.8C no.5
• /
• pp.607-614
• /
• 2001

With a remarkable growth and expansion of Internet, the security issues emerged from intrusions and attacks such as computer viruses, denial of services and hackings to destroy information have been considered as serious threats for Internet and the private networks. To protect networks from those attacks, many vendors have developed various security systems such as firewalls, intrusion detection systems, and access control systems. However, managing those systems individually requires too much work and high cost. Thus, in order to manage integrated security management and establish consistent security management for various security products, the policy model of PN-ISMS (Policy Based Integrated Security Management System) has become very important. In this paper, present the hierarchical policy model which explore the refinement of high-level/conceptual policies into a number of more specific policies to form a policy hierarchy. A formal method of policy description was used as the basis of the mode in order to achieve precision and generality. Z-Notation was chosen for this propose. The Z-Notation is mathematical notation for expressing and communicating the specifications of computer programs. Z uses conventional notations of logic and set theory organized into expressions called schemas.

• Journal of Korea Multimedia Society
• /
• v.7 no.1
• /
• pp.1-11
• /
• 2004

In this paper. we propose a storage system for XML documents using relational databases. Additional processing is required to store XML documents in the relational databases due to the discrepancy between XML structures and relational schema. This study aims to store XML documents with DTD in the relational databases. We propose the association inlining that exploits shred inlining and hybrid inlining and avoids relation fragments and excessive joins. Experiments show some improvements in the performance with the proposed method. The information of the storage structures is extracted from the simplified DTD. Existing map classes are extended in order to map various structures of XML to relational schema. Map classes are defined for various structures such as elements with multiple values, elements with multiple super elements, and elements with recursive structures through analyzing XML documents. Map files that are XML structures and used in generating SQL statements are created by using the extracted information of storage structures and map classes.

• Journal of KIISE:Databases
• /
• v.31 no.4
• /
• pp.432-443
• /
• 2004

As the XML data has been widely used in the Internet, it is necessary to store and retrieve the XML data by using DBMSs. However, relational DBMSs suffer from the model difference between graph structure of the XML data and table forms in relational databases. We propose an ORDBMS-based DTD-dependent XML data management system Xing. Xing stores XML data in a DTD-dependent form in an object database. Since the object database schema has a graph structure and supports multi-valued attributes, mapping from an XML data model and queries into an object data model and OQLs is a simple problem. For rapid storing of large quantities of the XML data, we use SAX parser with customized Xing-tree which requires a small memory space compared with the DOM-tree. Xing also returns the query result in an XML document form. We have implemented the Xing system on top of UniSQL object-relational DBMS for the validity checking and performance comparison. For XML genome data from GenBank, and experimental evaluation shows that Xing can provide significant performance improvement (maximum 10 times) compared with the relational approach.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.5B
• /
• pp.379-385
• /
• 2008

For the sharing and exchange of information between medical clinics, the clinical document has to be built on a standardized protocol such as a HL7-CDA. But it is difficult to exchange information between medical clinics because clinical document such as electronic medical record that include text and image, have different structure of document and type of expression. In this paper, we propose the electronic medical record system based on HL7-CDA that can share and exchange clinical information between medical institute. For this purpose, we have to design the schema of the clinical document architecture after we select the essential items of medical record and define templates. The proposed system can minimize integrating process and save parsing time when clinical information exchange and refer, by converting electronic medical record to base64 encoding scheme and integrate it in a XML document.

• Journal of KIISE:Databases
• /
• v.31 no.5
• /
• pp.540-552
• /
• 2004

We propose XIR-Linear, a novel method for processing partial match queries on large-scale heterogeneous XML documents using information retrieval (IR) techniques. XPath queries are written in path expressions on a tree structure representing an XML document. An XPath query in its major form is a partial match query. The objective of XIR-Linear is to efficiently support this type of queries for large-scale documents of heterogeneous schemas. XIR-Linear has its basis on the schema-level methods using relational tables and drastically improves their efficiency and scalability using an inverted index technique. The method indexes the labels in label paths as key words in texts, and allows for finding the label paths that match the queries far more efficiently than string match used in conventional methods. We demonstrate the efficiency and scalability of XIR-Linear by comparing it with XRel and XParent using XML documents crawled from the Internet. The results show that XIR-Linear is more efficient than both XRel and XParent by several orders of magnitude for linear path expressions as the number of XML documents increases.

• The Journal of Society for e-Business Studies
• /
• v.13 no.3
• /
• pp.121-135
• /
• 2008

Railroad logistics transporting freight by train takes charge of 10 or 20 percent of domestic cargos. Railroad logistics users such as transport companies including shippers or Inland Container Depot(ICD) use electronic document(EDI or XML) or input data through WEB to process railroad logistics business. However, as business environments evolving into e-business, it is required to upgrade the legacy railroad logistics process. As the increase of using ebXML-based schema format, it is also needed to improve the electronic documents based on DTD format into those of XML schema format. This study deals with information standard for railroad logistics to improve the railroad logistics business. To this purpose railroad business processes were re-defined through the standard business process modeling methodology. Information model was also derived by defining railroad logistics activities from business process model. And Business Information Entities(BIEs) were defined to design new electronic documents according to the extracted information model. An improved system architecture for railroad logistics was proposed as well. The results of this study will provide an effective and flexible business flow to railroad logistics business.

• KSCI Review
• /
• v.14 no.2
• /
• pp.185-197
• /
• 2006

A star schema consists of a central fact table, which is surrounded by one or more dimension tables. Each row int the fact table contains a multi-part primary key(or a composite foreign key) along with one or more columns containing various facts about the data stored in the row Each of the composit foreign key components is related to a dimensional table. The combination of keys in the fact table creates a composite foreign key that is unique to the fact table record. The composite foreign key, however, is rarely unique to the fact table record in real-world applications, particularly in financial applications. In order to make the composite foreign key be the determinant in real-world application, some precalculation might be performed in the SQL relational database, and cached in the OLAP database. However, there are many drawbacks to this approach. In some cases, this approach might give users the wrong results. In this paper, an approach to fact table modeling and related MDX query composing, which can be used in real-world applications without performing any precalculation and gives users the correct results, is proposed.

• Journal of KIISE:Software and Applications
• /
• v.32 no.6
• /
• pp.554-569
• /
• 2005

In the semistructured distributed documents, it is very difficult to formalize and implement the query processing system due to the lack of structure and rule of the data. In order to precisely retrieve and process the heterogeneous semistructured documents, it is required to handle multiple mappings such as 1:1, 1:W and W:1 on an element simultaneously and to generate the schema from the distributed documents. In this paper, we have proposed an query processing algorithm for querying and answering on the heterogeneous semistructured data or documents over distributed systems and implemented with a metadata interface. The algorithm for generating local queries from the global query consists of mapping between g1oba1 and local nodes, data transformation according to the mapping types, path substitution, and resolving the heterogeneity among nodes on a global input query with metadata information. The mapping, transformation, and path substitution algorithms between the global schema and the local schemas have been implemented the metadata interface called DBXMI (for Distributed Documents XML Metadata Interface). The nodes with the same node name and different mapping or meanings is resolved by automatically extracting node identification information from the local schema automatically. The system uses Quilt as its XML query language. An experiment testing is reported over 3 different OEM model semistructured restaurant documents. The prototype system is developed under Windows system with Java and JavaCC compiler.

• The KIPS Transactions:PartD
• /
• v.15D no.6
• /
• pp.861-872
• /
• 2008

As rapid development of computing environment, field of automatic identification research which interoperates with various physical objects and digital information is making active progress. Although the automatic identification system is widely used in various industries, application of automatic identification system in the field of medical health doesn't reach other industry. Therefore research in medical health supplies such as medical equipment, blood, human tissues and etc is on progress. This paper suggests the application of automatic identification technology for biological resources which is core research material in human genome research. First of all, user environment requirements for the introduction of automatic identification technology are defined and through the experiments and research, barcode is selected as a suitable tag interface. Data Matrix which is 2D barcode symbology is chosen and data schema is designed based on UCC/EAN-128 for international defecto standard. To showapplicability of proposed method when applied to actual environment, we developed, tested and evaluated application as following methods. Experiments of barcode read time at 196 and 75 below zero which is actual temperature where biological resources are preserved resulted read speed of average of 1.6 second and the data schema satisfies requirements for the biological resources application. Therefore suggested method can provide data reliability as well as rapid input of data in biological resources information processing.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.1 s.45
• /
• pp.177-188
• /
• 2007

A star schema consists of a central fact table, which is surrounded by one or more dimension tables. Each row in the fact table contains a multi-part primary key(or a composite foreign key) along with one or more columns containing various facts about the data stored in the row. Each of the composit foreign key components is related to a dimensional table. The combination of keys in the fact table creates a composite foreign key that is unique to the fact table record. The composite foreign key, however, is rarely unique to the fact table retold in real-world applications, particularly in financial applications. In order to make the composite foreign key be the determinant in real-world application, some precalculation might be performed in the SQL relational database, and cached in the OLAP database. However, there are many drawbacks to this approach. In some cases, this approach might give users the wrong results. In this paper, an approach to fact table modeling and related MDX query composing, which can be used in real-world applications without performing any precalculation and gives users the correct results, is proposed.