• The Journal of the Convergence on Culture Technology
• /
• v.9 no.3
• /
• pp.835-843
• /
• 2023

Given the structure of XML data, path and tree pattern matching algorithms play an important role in XML query processing. To facilitate decisions or relationships between nodes, nodes in an XML tree are typically labeled in a way that can quickly establish an ancestor-descendant on relationship between two nodes. However, these techniques have the disadvantage of re-labeling existing nodes or recalculating certain values if insertion occurs due to sequential updates. Therefore, in current labeling techniques, the cost of updating labels is very high. In this paper, we propose a new labeling technique called Fast XML encoding, which supports the update of order-sensitive XML documents without re-labeling or recalculation. It also controls the length of the label by reusing deleted labels at the same location in the XML tree. The proposed reuse algorithm can reduce the length of the label when all deleted labels are inserted in the same location. The proposed technique in the experimental results can efficiently handle order-sensitive queries and updates.

• 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 the Korean Institute of Intelligent Systems
• /
• v.19 no.2
• /
• pp.236-241
• /
• 2009

Information integration for distributed and heterogeneous data sources is still an open challenging, and schema matching is critical in this process. This paper presents and approach to automatic elements matching between XML application schemas using similarity measure and relaxation labeling. The semantic modeling of XML application schema has also been presented. The similarity measure method considers element categories and their properties. In an effort to achieve an optimal matching, contextual constraints are used in the relaxation labeling method. Based on the semantic modeling of XML application schemas, the compatible constraint coefficients are devised in terms of the structures and semantic relationships as defined in the semantic model. To examine the effectiveness of the proposed methods, an algorithm for XML schema matching has been developed, and corresponding computational experiments show changes of calculated values.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.877-895
• /
• 2010

The state-of-the-art techniques of storing XML data, modeled as an XML tree, are node-based in the sense that they are centered around XML node labeling and the storage unit is an XML node. In this paper, we propose a generalization of such techniques so that the storage unit is an XML subtree that consists of one or more nodes. Despite several advantages with such generalization, a major problem would be inefficiency in XPath processing where the stored subtrees are to be parsed on the fly in order for the nodes inside them to be accessed. We solve this problem, proposing a technique whereby no parsing of the subtrees involved in XPath processing is needed at all unless they contain the nodes of the final query result. We prove that the correctness of XPath processing is guaranteed with our technique. Through implementation and experiments, we also show that the overhead of our technique is acceptable.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06c
• /
• pp.164-169
• /
• 2010

본 논문에서는 계층적 데이터를 관계형 데이터베이스 시스템에 저장하기 위한 요구사항을 만족하는 XML 레이블링 기법으로서 Farey Sequence 를 응용한 Faray 레이블링 기법을 제안한다. 이는 일반적인 동적 삽입연산 외에 형제간 노드 사이에 새 노드를 삽입할 경우 추가적인 레이블의 사이즈 증가 없이 기존노드의 리레이블링이 없고, 말단 노드의 삭제시 레이블의 재사용이 원할하며, 부모와 자식 사이에 새 노드를 삽입하는 경우가 빈번한 계층적 데이터 관리 시에 리레이블링을 최소화 할 수 있는 방법이다. 기존 XML 레이블링 기법이 부모 자식사이에 삽입 연산을 하는 경우 하위의 모든 노드를 리레이블링 해야 하는것에 비하여 본 기법은 오직 1개의 하위 노드만을 리레이블링 하기 때문에 해당 경우의 계층적 데이터의 동적 삽입 시 하위 노드의 개수에 상관없이 일정하게 연산시간을 유지할 수 있다.

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

범위 기반 레이블링 스킴(range-based labeling scheme)을 이용하면 임의의 두 노드에 대한 조상-자손 관계를 쉽게 판별할 수 있으므로, XPath나 XQuery 형태의 질의를 효율적으로 처리할 수 있다. 그러나 노드의 삽입이 일어나는 동적인 상황에서는 불가피하게 전체 또는 일부의 레이블을 다시 할당(re-labeling)할 가능성이 있다는 문제점이 있다. 본 논문에서는 Dietz 레이블링 스킴을 개선한 EP2(extended preorder ＆amp; postorder) 레이블링 스킴을 제안한다. 제안하는 스킴은 동일한 저장 공간상에서 범위 기반 레이블링 스킴에 비해 동적인 갱신에 유리하며, 기존의 구조 조인 알고리즘(structural join algorithm)을 이용하여 효율적으로 구조 질의(structural query)를 처리할 수 있다.

• Journal of KIISE:Databases
• /
• v.35 no.1
• /
• pp.67-83
• /
• 2008

In order to realize ubiquitous computing, it is essential to efficiently use the resources and the computing power of mobile devices. Among others, memory efficiency, energy efficiency, and processing efficiency are required in executing the softwares embedded in mobile devices. In this paper, query processing over XML data in a mobile device where resources are limited is addressed. In a device with limited amount of memory, the techniques of XML. stream query processing need to be employed to process queries over a large volume of XML data Recently, a technique Galled XFrag was proposed whereby XML data is fragmented with the hole-filler model and streamed in fragments for processing. With XFrag, query processing is possible in the mobile device with limited memory without reconstructing the XML data out of its fragment stream. With the hole-filler model, however, memory efficiency is not high because the additional information on holes and fillers needs to be stored. In this paper, we propose a new technique called XFLab whereby XML data is fragmented with the XML labeling scheme which is for representing the structural relationship in XML data, and streamed in fragments for processing. Through implementation and experiments, XML showed that our XFLab outperformed XFrag both in memory usage and processing time.

• The Journal of the Korea Contents Association
• /
• v.4 no.4
• /
• pp.1-10
• /
• 2004

Dialogue speech corpora that contain sufficient dialogue speech features are needed for performance assessment of a spoken language dialogue system. And labeling information of dialogue speech corpora plays an important role for improvement of recognition rate in acoustic and language models. In this paper, we examine the methods by which labeling information of dialogue speech corpora can be structured. More specifically, we examined how to represent features of dialogue speech in a structured document based XML and how to design the repository system of the information.

• International journal of advanced smart convergence
• /
• v.10 no.2
• /
• pp.64-72
• /
• 2021

XML message brokers have a lot of importance because XML has become a practical standard for data exchange in many applications. Message brokers covered in this document store many users. This paper is a study of the processing of twig pattern queries in XML documents using branching node streams in XML message broker structures. This work is about query processing in XML documents, especially for query processing with XML twig patterns in the XML message broker structure and proposed a method to reduce query processing time when parsing documents with XML twig patterns by processing information. In this paper, the twig pattern query processing method of documents using the branching node stream removes the twigging value of the branch node that does not include the labeling value of the branch node stream when it receives a twig query from the client. In this paper, the leaf node discovery time can be reduced by reducing the navigation time of nodes in XML documents that are matched to leaf nodes in twig queries for client twig queries. Overall, the overall processing time to respond to queries is reduced, allowing for rapid question-answer processing.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11b
• /
• pp.10-12
• /
• 2005

XML이 데이터 표현과 문서 교환의 표준으로 떠오름에 따라 XML문서에 대한 보안이 중요하게 되었다. 이 논문에서는 XML 보안을 위하여 W3C의 암호화 방법에 접근 제어 기법을 적용시킨 XML Pool Encryption 방법을 기반으로 XML 문서의 구조 정보를 빠르고 쉽게 파악할 수 있는 새로운 레이블링 기법을 제안한다. 제안하는 기법은 계층 구조의 특성을 갖는 XML 문서에서 하위 정보의 위치에 상위 정보의 위치를 포함시킴으로써 문서 일부에 대해서도 구조 정보의 유추가 가능하다. 또한 XML문서의 변화(문서의 갱신, 수정. 삭제) 시에도 문서 전체의 레이블링을 변화시키지 않고, 변화하는 부분에 대해서만 새로운 레이블을 부여한다는 장점이 있다. 실험 결과에서는 제안된 기법이 XML 문서상에서의 위치 정보를 찾는 데에 효율적임을 보여준다.