CAJ | 학술논문

有效地存储查询XML文档已经成为当今数据库领域的研究热点.从XML文档的路径统计出发,提出了路径分区存储编码方案,并依此消除了小枝查询的后裔边和通配符.针对这类不合"//"和"*"的小枝查询,利用路径分区编码的特性,给出了基于结构约束节点的Twig查询算法,极大地减少了结构连接次数.实验表明,该算法能有效滤除无关元素,提高小枝查询效率.
유효지존저사순XML문당이경성위당금수거고영역적연구열점.종XML문당적로경통계출발,제출료로경분구존저편마방안,병의차소제료소지사순적후예변화통배부.침대저류불합"//"화"*"적소지사순,이용로경분구편마적특성,급출료기우결구약속절점적Twig사순산법,겁대지감소료결구련접차수.실험표명,해산법능유효려제무관원소,제고소지사순효솔.
Effectively storing and querying XML documents becomes a hot research topic on current database domain. In the light of path summary, path-partitioned encoding scheme was proposed to store an XML document, and useful for eliminating descendant axes and wildcards in twig queries. For twig queries without"//"or"*", a new query algorithm was developed based on structure-constrained nodes, so structural joins extremely decreases. The results of experiments indicate the algorithm can significantly filter useless elements and improve the performance for twig queries. Keywards XML, Twig query, Structural join, Path summary