• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.8 no.2
• /
• pp.121-125
• /
• 2008

It is essential to maintain hierarchical information properly for efficient XML query processing. Well known approach to represent hierarchical information of XML tree is assigning a specific node number to each node of XML tree. Insertion and deletion of XML node can occur at any position in a dynamic XML tree. A dynamic numbering scheme allows us to add nodes to or delete nodes from an XML tree without relabeling or with relabeling only a few existing nodes of XML tree while executing XML query efficiently. According to W3C XQuery update facility specifications a node can be added as first or last child of the existing node in XML tree. Generating new number for last child requires referencing the number of previous last child. Getting the number of last child is very costly with previous approaches. We have developed a new dynamic numbering scheme PSN which is very effective for insertion of a node as last child. Our approach reduces the time to find last child dramatically by removing sorting of children.

• Journal of KIISE:Databases
• /
• v.36 no.3
• /
• pp.180-188
• /
• 2009

Recently, the needs for an efficient and secure access control method of dynamic XML data in a ubiquitous data streams environment have become an active research area. In this paper, we proposed an improved role-based prime number labeling scheme for an efficient and secure access control labeling method in dynamic XML data streams. And we point out the limitations of existing access control and labeling schemes for XML data assuming that documents are frequently updated. The improved labeling method where labels are encoded ancestor-descendant and sibling relationships between nodes but need not to be regenerated when the document is updated. Our improved role-based prime number labeling scheme supports an infinite number of updates and guarantees the arbitrary nodes insertion at arbitrary position of the XML tree without label collisions. Also we implemented an efficient access control using a role-based prime number labeling. Finally, we have shown that our approach is an efficient and secure through experiments.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.4
• /
• pp.169-177
• /
• 2011

As demand for efficiency in handling dynamic XML data grows, new dynamic XML labeling schemes have been researched. The key idea of the dynamic XML labeling scheme is to find ancestor-descendent-sibling relationships and to minimize memory space to store total label, response time and range of relabeling incurred by update operations. The prime number labeling scheme is a representative scheme which supports dynamic XML documents. It determines the ancestor-descendant relationships between two elements by a simple divisibility test of labels. When a new element is inserted into the XML data using this scheme, it does not change the label values of existing nodes. However, since each prime number must be used exclusively, labels can become significantly large. Therefore, in this paper, we introduce a novel technique to effectively reduce the problem of label overflow. The suggested idea is based on tree decomposition. When label overflow occurs, the full tree is divided into several sub-trees, and nodes in each sub-tree are separately labeled. Through experiments, we show the effectiveness of our scheme.

• Journal of KIISE:Databases
• /
• v.36 no.2
• /
• pp.150-167
• /
• 2009

XML has become the new standard for storing, exchanging, and publishing of data over both the internet and the ubiquitous data stream environment. As demand for efficiency in handling XML document grows, labeling scheme has become an important topic in data storage. Recently proposed labeling schemes reflect the dynamic XML environment, which itself provides motivation for the discovery of an efficient labeling scheme. However, previous proposed labeling schemes have several problems: 1) An insertion of a new node into the XML document triggers re-labeling of pre-existing nodes. 2) They need larger memory space to store total label. etc. In this paper, we introduce a new labeling scheme called a Circle Labeling Scheme. In CLS, XML documents are represented in a circular form, and efficient storage of labels is supported by the use of concepts Rotation Number and Parent Circle/Child Circle. The concept of Radius is applied to support inclusion of new nodes at arbitrary positions in the tree. This eliminates the need for re-labeling existing nodes and the need to increase label length, and mitigates conflict with existing labels. A detailed experimental study demonstrates efficiency of CLS.

• Journal of Internet Computing and Services
• /
• v.2 no.5
• /
• pp.59-70
• /
• 2001

Recently, in various fields XML has been become a standard for information exchange in internet. Therefore, the researches on data modeling for storing and fetching the XML documents have been made actively. However, existing researches have weak points that they can support neither versioning nor fast fetching of documents while changing documents in dynamic environments. In this paper, we propose four kinds of hybrid data modeling schemes that combine fragmentation model and nonfragmentation model. Our data modeling schemes are suitable to dynamic environments. We also present guidelines that our hybrid data modeling schemes can be used for various applications. We shaw through various experiments that our hybrid schemes partially outperforms the existing modeling schemes in terms of insertion time, storage space and retrieval time.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.11
• /
• pp.4583-4591
• /
• 2010

Existing XML-based variable data publishing, in which a user has to manually prepare and edit template rules, is rather difficult for general users to create documents. Especially when processing large variable XML documents such as manuals or technical documents, fast document formatting is required to provide fast response speed for editing, which the existing batch processing cannot provide. This paper proposes a variable data publishing system with dynamic editing and formatting function, which support fast formatting upon user's request for large volume documents as well as for template editing through interaction by displaying the result of template-based variable documents on WYSIWYG screen. Proposed system can be effectively used for creating customized documents with many variable data that can be changed according to individual characteristics such as individual, company or area; source documents, template documents and formatted documents adopt XML, XSLT and XPath standards suggested by W3C, which facilitates extension to web document processing system.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.129-137
• /
• 2006

An XML labeling scheme is an efficient encoding method to determine the ancestor-descendant relationships of elements and the orders of siblings. Recently, many dynamic XML documents have appeared in the Web Services and the AXML(the Active XML), so we need to manage them with a dynamic XML labeling scheme. The prime number labeling scheme is a representative scheme which supports dynamic XML documents. It determines the ancestor-descendant relationships between two elements with the feature of prime numbers. When a new element is inserted into the XML document using this scheme, it has an advantage that an assigning the label of new element don't change the label values of existing nodes. But it has to have additional expensive operations and data structure for maintaining the orders of siblings. In this paper, we suggest the order number sharing method and algorithms categorized by the insertion positions of new nodes. They greatly minimize the existing method's sibling order maintenance cost.

• Proceedings of the CALSEC Conference
• /
• 2000.08a
• /
• pp.179-186
• /
• 2000

ㆍ A sub-set of SGML (Standard Generalized Markup Language) ㆍ A family of standards ㆍ XML 1.0 is the specification that defines what tags, attributes and other XML nodes are ㆍ License-free, platform-independent and well-supported ㆍ Simple ▶ Human-readable, easy to use ㆍ Extensible ▶ A dynamic data model ㆍ Flexible ▶ For handling complex data ㆍ Portable ▶ For cross-platform data exchange ㆍ Standard ▶ Easy to integrate, widely adopted(omitted)

• The KIPS Transactions:PartD
• /
• v.15D no.1
• /
• pp.1-14
• /
• 2008

This paper is on query processing in the mobile devices where memory capacity is limited. In case that a query against a large volume of XML data is processed in such a mobile device, techniques of fragmenting the XML data into chunks and of streaming and processing them are required. Such techniques make it possible to process queries without materializing the XML data in its entirety. The previous schemes such as XFrag[4], XFPro[5], XFLab[6] are not scalable with respect to the increase of the size of the XML data because they lack proper memory management capability. After some information on XML fragments necessary for query processing is stored, it is not deleted even after it becomes of no use. As such, when the XML fragments are dynamically generated and infinitely streamed, there could be no guarantee of normal completion of query processing. In this paper, we address scalability of query processing over dynamic XML fragment stream, proposing techniques of deleting information on XML fragments accumulated during query processing in order to extend the previous schemes. The performance experiments through implementation showed that our extended schemes considerably outperformed the previous ones in memory efficiency and scalability with respect to the size of the XML data.

• The Journal of the Korea Contents Association
• /
• v.14 no.1
• /
• pp.14-23
• /
• 2014

There have been many researches for XML as the international standard to store and exchange data on the internet. Among these research fields, we focus on the techniques labeling the nodes of the XML tree that is required for querying the structural information. A labeling scheme assigns the unique label to the nodes and supports the queries for the structural information such as Ancestor-Descendant and Parent-Child relationships. In this paper, we propose a labeling scheme using vector representation where the assigned labels are not altered although XML documents are changed dynamically. Our labeling scheme reduces the storage requirement for the labels of the XML tree and provides the efficient query by using the fixed-length labels with a short size. Result of performance evaluation shows that our labeling scheme is superior to the previous approaches.