Interval-based labeling schemes for efficient XML query processing효율적인 XML 질의 처리를 위한 구간 기반 레이블링 기법

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 471
  • Download : 0
XML data can be represented by a tree or graph structure and XML query processing requires the information of structural relationships among nodes. The basic structural relationships are parent-child and ancestor-descendant, and finding all occurrences of these basic structural relationships in an XML data is clearly a core operation in XML query processing. Several node labeling schemes have been suggested to support the determination of ancestor-descendant or parent-child structural relationships simply by comparing the labels of nodes. However, the previous node labeling schemes have some disadvantages, such as a large number of nodes that need to be relabeled in the case of an insertion of XML data, huge space requirements for node labels, and inefficient processing of structural joins. Additionally there is a growing interest in the data model and query processing for probabilistic XML data. There are many potential applications of probabilistic data, and the XML data model is suitable to represent hierarchical information and data uncertainty of different levels naturally. However, the previously proposed probabilistic XML data models and query processing techniques separate finding data matches and evaluating the probabilities of results. Therefore, they should repeatedly access the data and need to get full data of paths given in queries to calculate the probabilities of results. In order to support efficient XML query and update processing, we propose the nested tree structure that eliminates the disadvantages and takes advantage of the previous node labeling schemes. The nested tree structure makes it possible to use the dynamic interval-based labeling scheme, which supports XML data updates with almost no node relabeling as well as efficient structural join processing. In addition, we suggest an extended interval-based labeling scheme for the probabilistic XML data tree and an efficient query processing procedure using the labeling scheme. Against p...
Advisors
Chung, Chin-Wanresearcher정진완researcher
Description
한국과학기술원 : 전산학과,
Publisher
한국과학기술원
Issue Date
2011
Identifier
466478/325007  / 020005204
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 전산학과, 2011.2, [ v, 54 p. ]

Keywords

Query; XML; Database; 레이블링 기법; 데이터베이스; 질의처리; Labeling

URI
http://hdl.handle.net/10203/33338
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=466478&flag=dissertation
Appears in Collection
CS-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0