• 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 the Korea Computer Industry Society
• /
• v.2 no.6
• /
• pp.775-782
• /
• 2001

Until recently Web retrieval engine has presented a demanded document to users according to the amount and the frequency of inquired key words in each document under the assumption that the more key words a document has, the more accessible it is. This method of searching doesn't matter to a normal document such as HTML Web data in which structural information is not involved. However, Web data realized in XML contains structural information and modeling of graphic forms is also available. Therefore, in the case of XML, this method leads to no less trouble since it depends only on the frequency of key words. We consider that this problem can be resolved by way of inquiry which is similar to SQL. This form of inquiry enables us to snatch an exact data we want in a quick and clear way with a full advantage of structural quality of XML, overcoming the shortcomings of frequency-based engine. In this paper, We aim to design a model of information retrieval system of XML data using XML DOM and consider its algorithm related with it.

• Journal of Korea Multimedia Society
• /
• v.11 no.7
• /
• pp.905-913
• /
• 2008

Many heterogeneous XML documents are being widely used with the increasing employment of XML, and the importance of data structure research for more efficient document management has been growing steadily. We propose a query processing technique which uses parent node information in a partitioned inverted index tree. The searching efficiency of these heterogeneous documents is greatly influenced by the number of query processing and the amount of target data sets in many ways. Therefore, considering these two factors is very important for designing a data structure. First, our technique stores parent node's information in an inverted index table. Then using this information, we can reduce the number of query processing by half. Also, the amount of target data sets can be lessoned by using partitioned inverted index table. Some XML documents collected from the Internet will be used to demonstrate the new method, and its high efficiency will be compared with some of the existing searching methods.

• The KIPS Transactions:PartD
• /
• v.14D no.6
• /
• pp.585-596
• /
• 2007

XML data generally consists of a hierarchical tree-structure which is reflected in mechanisms to store and retrieve XML data. Therefore, when storing XML data in the database, the hierarchical relationships among the XML elements are taken into consideration during the restructuring and storing of the XML data. Also, in order to support the search queries from the user, a mechanism is needed to compute the hierarchical relationship between the element structures specified by the query. The structural join operation is one solution to this problem, and is an efficient computation method for hierarchical relationships in an in database based on the node numbering scheme. However, in order to process a tree structured XML query which contains a complex nested hierarchical relationship it still needs to carry out multiple structural joins and results in another problem of having a high query execution cost. Therefore, in this paper we provide a preprocessing mechanism for effectively reducing the cost of multiple nested structural joins by applying the concept of equivalence classes and suggest a query path reduction algorithm to shorten the path query which consists of a regular expression. The mechanism is especially devised to reduce path queries containing branch nodes. The experimental results show that the proposed algorithm can reduce the time requited for processing the path queries to 1/3 of the original execution time.

• Journal of National Security and Military Science
• /
• s.1
• /
• pp.269-310
• /
• 2003

AS Extensible Markup Language(XML) is emerging as the data format of the Internet era, there are increasing needs to efficiently transform between database and XML documents. In this paper, we propose a schema transformation method from relational database to XML database. To transform the schema, we represent input schema as Entity-Relationship diagram. Entity-Relationship model translator scans the input Entity-Relationship diagram using BFS (breadth First Search) and translates the diagram into hierarchical structure model. The XML Schema generator produces XML Scema code using the transformed hierarchical structure model. The proposed method has a merit that having reusability facility of XML Schema property in comparison with existing researches.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.355-360
• /
• 2004

With the growing acceptance of XML technologies, XML will be the most common tool for all data manipulation and data transmission. Meeting security requirements for privacy, confidentiality and integrity is essential in order to move business online and it is important for security to be integrated with XML solutions. Many policies require certain conditions to be satisfied and actions to be performed before or after a decision is made. Binary yes/no decision to an access request is not enough for many applications. These issues were addressed and formalized as provisions and obligations by Betti et Al. In this paper, we propose an authorization model with provisions and obligations in XML. We introduce a formal definition of authorization policy and the issues involving obligation discussed by Betti et Al. We use the formal model as a basis to develop an authorization model in XML. We develop DTDs in XML for main components such as authorization request, authorization policy and authorization decision. We plan to develop an authorization system using the model proposed.

• The KIPS Transactions:PartA
• /
• v.11A no.2
• /
• pp.149-158
• /
• 2004

XML as a standard for representing data and document structure is widely used in every area, and we have to write XML compilers which process the XML documents according to a user's intention. Because it takes time and costs to write XML compilers by hand, we need some generators that automatically generate XML compilers. In this paper, we introduce an XML compiler generator named XCC. It reads DTD and semantic rules, and it generates XML compiler and Java classes which correspond to the elements defined in the DTD.

• Journal of Advanced Research in Ocean Engineering
• /
• v.4 no.3
• /
• pp.96-104
• /
• 2018

The importance of data management for the efficient maintenance and operation of offshore structures is becoming increasingly important. This paper has discussed the data schema and business rules that standardize the data exchange between ship design, operation and maintenance. Technical documentation that meets the international standards of ShipDex and S1000D for exchanging the operation and management data in neutral or standard formats has been introduced into the life cycle management of ships. The schema of the data exchange is represented by XML (eXtensible Markup Language) and the lifecycle data is implemented by a structured document. Lifecycle data is represented as data modules defined by XML schema. Given the feasible data generation, an example of a technical document is introduced by a general XML authoring tool.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10b
• /
• pp.205-207
• /
• 2004

인터넷의 급속한 발전으로 인해 다양한 종류의 데이터들이 증가하게 되었으며 이러한 데이터의 표현과 데이터 교환을 위해 XML이 사실상의 표준으로 빠르게 자리 잡아 가고 있다. XML문서를 데이터로 저장 시 오랜 기간에 걸쳐서 성숙된 RDBMS를 사용하여 XML데이터를 RDBMS로 저장 시 발생할 수 있는 단편화 방지와 XML질의의 효과적인 질의 처리에 대한 많은 연구들이 제안되었다. 본 논문에서는 XML 문서를 관계형 데이터베이스 스키마로 저장 시 발생할 수 XML문서내의 엘리먼트의 관계에 대한 정보를 저장하기 위해서 추가적으로 발생하는 정보의 수를 줄이고 엘리먼트간의 관계를 효과적으로 저장할 수 있는 방법에 대해서 연구한다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.06a
• /
• pp.79-82
• /
• 2001

W3C에서 제안한 XML표준안이 발표된 이후 인터넷 기반의 다양한 분야에서 XML기술을 활용하고자 하는 움직임이 많아지고 있다. 그 중 한 분야가 기존의 데이터베이스 구조를 이질의 플랫폼에 영향을 받지 않고 XML을 매개로 하여 저장 및 관리가 가능한 시스템을 구축하고자 하는 연구이다. 이는 분산 환경에서의 각자의 고유한 데이터베이스 스키마를 가지고 운영되는 기존의 정보 시스템들을 XML이라는 공통 데이터 모델을 사용하여 표현함으로써 저장 및 관리상에 효율성 증대를 제공하는 것이다.