Integration of a structural index with a structural join for accelerating path queries

被引：0

作者：

Kim, Jongik ^{[1
]}

Lee, SooCheol ^{[1
]}

Kwon, Oh-Cheon ^{[1
]}

机构：

[1] Elect & Telecommun Res Inst, Telemat Serv Convergence Res Team, Telemat USN Res Div, Taejon 305606, South Korea

来源：

COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2006, PT 2 | 2006年 / 3981卷

关键词：

XML; semi-structured data; path query; structural index; structural join;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Current techniques for processing XML queries can be divided into two groups. One is structural index techniques that reduce the search space by traversing a structural summary instead of a data graph. And the other is structural join techniques that can efficiently compute ancestor-descendant pairs from two lists of nodes without traversing the data graph. In this paper, we propose a structural index technique and a novel structural join technique and we prove that these two proposed techniques are integrated to accelerate processing of a path query in the experiments.

引用

页码：552 / 561

页数：10

共 11 条

[1] ALKHALIFA S, 2002, IEEE INT C DAT ENG
[2] BRUNO N, 2002, P ACM SIGMOD INT C M
[3] Chamberlin D., 2001, XQUERY QUERY LANGUAG
[4] CHEIN SY, 2002, P C VER LARG DAT BAS
[5] DEUTSCH A, 1999, P 8 INT WORLD WID WE
[6] GOLDMAN R, 1997, P C VER LARG DAT BAS
[7] Efficient processing of regular path joins using PID
Kim, J
Kim, HJ
[J]. INFORMATION AND SOFTWARE TECHNOLOGY, 2003, 45 (05) : 241 - 251
[8] LI Q, 2001, P C VER LARG DAT BAS
[9] MILO T, 1999, P INT C DAT THEOR
[10] *XMARK, XML BENCHM PROJ

← 1 2 →