• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.703-706
• /
• 2000

In recent years. XML applications are being developed in diverse area. Especially, development of XML document repository system associated with database is carrying out widely. The previous researches of XML repository system have several defects which are update and retrieval limitations for the XML document, design limitation for a formal retrieval algorithm and data redundancy. In order to solve the above problems. in this paper, we suggest relational database schemes for overcoming limitations of updating, retrieving, and rebuilding document. And suggest query translation strategy using two-phase translation that consists of pattern analyzing phase and SQL generating phase.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.52-54
• /
• 2005

XML이 웹 정보 시스템의 데이터베이스로 활용되면서 공유 부분에 대한 데이터 처리의 높은 효율성을 제공하고자 최소 단위의 접근제어 모델에 대한 연구가 판독 모드 측면에서 활발히 진행되었다. 질의 처리 연구에서는 XML 데이터베이스에 대한 갱신 질의 표준화 작업이 진행되고 있다. 본 논문은 갱신 질의 연산을 최소 단위 접근제어 모델의 연산 모드로 추가함으로써 발생하는 보이지 않는 조상 문제를 정의한다. 이를 해결하기 위한 고려 사항으로 보이지 않는 조상 노드들을 포함하는 XML 문서에 대한 갱신 연산 시 고려해야 할 특성을 갱신의 비밀성, 갱신의 무결성, 그리고 갱신의 일관성으로 정의하고 갱신 연산 수행 시 발생될 수 있는 특성 위배 상황을 정리한다.

• Journal of Korea Multimedia Society
• /
• v.8 no.5
• /
• pp.606-617
• /
• 2005

There have been many research efforts which find efficiently all occurrences of the structural relationships between the nodes in the XML document tree for processing a XML query. Most of them use the region numbering which is based on positions of the nodes. Hut The position-based node numbering schemes require update of many node numbers in the XML document li the XML nodes are inserted frequently in the same position. In this paper, we propose ENN(extensible node numbering) scheme using the bucket number which is represented with the variable-length string for decreasing the number of the node numbers which is updated. We also present an performance analysis by comparing ENN method with TP(extended preorder) method.

• The Journal of Korean Association of Computer Education
• /
• v.6 no.4
• /
• pp.11-21
• /
• 2003

In rapidly changing an information=oriented society, it is essential to control massive document information by electronic file. In relation to these electronic document, it is also important to keep and maintain all kinds of information without any losses. It should be allowed to trace previous contents as well as recently updated contents by controlling updated contents with version. For these, XML is recommendable. In this thesis, we intend to save the document storing space by saving only updated contents with version without saving whole documentation, when document is updated. In case of controlling the history of document update by version, we designed system so as to omit "JOIN operation" if document size is under a certainspecific size. Therefore, we implemented a new XML document repository system which is possible for quick search and efficient XML document saving by reducing perfomance deterioration caused by JOIN operation.

• 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 KIISE:Computing Practices and Letters
• /
• v.8 no.6
• /
• pp.746-755
• /
• 2002

EXPRESS is product information description language. It is interpretable by human and software. Product data written in EXPRESS make it possible to exchange between heterogeneous systems. However, the number of software that can use EXPRESS is limited and it is expensive to use the software. XML makes it possible to update and manage data on the Web. Because the Web is easier to use and access than other tools comparatively, data represented by XML need not depend on specific applications or systems and it can be used for exchange of data. Therefore, if we represent EXPRESS-driven data in XML, there will be more active data exchange widely and easily In this work, a method of translation EXPRESS document to XML DTD and XML Schema is proposed. By classification all of EXPRESS syntax element and consideration complex cases caused by this syntax element, a translation rule that represent XML DTD and XML Schema is suggested. Also, a translator which is corresponding to this rule is implemented.

• The KIPS Transactions:PartD
• /
• v.11D no.4
• /
• pp.845-854
• /
• 2004

Motif databases are used in the function and structure prediction of proteins. The frequency of use about these databases increases continuously because of protein sequence data growth. Recently, many researches about motif resource integration are proceeding. However, existing motif databases were developed independently, thus these databases have a heterogeneous search result problem. Database intnegration for this problem resolution has a periodic update problem, a complex query process problem, a duplicate database entry handling problem and BML support problem. Therefore, in this paper, we suppose a database resource integration method for these problem resolution, describe periodically integrated database update method and XML transformation. finally, we estimate the implementation of our prototype and a case database.

• Journal of Korea Multimedia Society
• /
• v.8 no.11
• /
• pp.1520-1530
• /
• 2005

As XML is recognized as a prevalent standard for document representation and exchange in the Internet, the need for security of XML becomes very important issue. Until now researches on XML security have been focused on confidentiality or integrity like encryption and digital signature technology. But, as XML data becomes more massive and complicated, it requires managerial security that decided access permit or deny by the authority oi user who is using the XML data. Thus it requires models and mechanisms enabling the specification and enforcement of access control policies for XML documents. In this paper, we suggest the new access control model and mechanism that separate XML documents by access level, assign roles to each user by applying Role Based Access Control (RBAC) and perform access control to specific documents by encrypting each section with roles. The method, we suggested, has an advantage that it does not need to update the whole keys used in encryption process by updating only the relations between appropriate secure layers.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.106-108
• /
• 2005

XML is situating a standard fur data exchange in the Web. Most applications use database to manage XML documents of high-capacity efficiently. Therefore, most applications create label that expresses structure information of XML data and stores with information of XML document. A number of labeling schemes have been designed to label the element nodes such that the relationships between nodes can be easily determined by comparing their labels. With the increased popularity of XML data on the web, finding a labeling scheme that is able to support order-sensitive queries in the presence of dynamic updates becomes urgent. XML documents that most applications use have many properties as their application. So, in the thesis, we present the most efficient updating methods dependent on properties of XML documents in practical application by choosing a representative labeling method and applying these properties. The result of our test is based on XML data management system, so it expect not only used directly in practical application, but a standard to select the most proper methods for environment of application to develop a new exclusive XML database or use XML.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.1
• /
• pp.80-89
• /
• 2011

While detecting changes in XML documents has emerged as a major research area, the level of research on edit scripts, which are the result of the change detection, is not far from satisfactory. In this paper, we present X-treeESgen, the algorithm generating edit scripts used in X-treeDiff+, a change detection algorithm for XML documents. X-treeESgen shows the time complexity of O(n), and support move and copy operations in addition to the basic set that is update, insert, and delete operations. Note that no other change detection algorithm provide all the operations. Also, since the process of generating edit scripts in X-treeESgen is designed independent of the process of matching, various tuning techniques may be applied.