OTJFast: Processing Ordered XML Twig Join Fast

被引:2
作者
Jiang, Jinhua [1 ]
Chen, Gang [1 ]
Shou, Lidan [1 ]
Chen, Ke [1 ]
机构
[1] Zhejiang Univ, Coll Comp Sci & Technol, Hangzhou, Zhejiang, Peoples R China
来源
2008 IEEE ASIA-PACIFIC SERVICES COMPUTING CONFERENCE, VOLS 1-3, PROCEEDINGS | 2008年
关键词
D O I
10.1109/APSCC.2008.15
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Thanks to standard specifications for web services, more and more data is represented and exchanged in XML. Efficiently finding all occurrences of a twig pattern is a core operation of XML query processing. Recently, a large number of holistic twig join algorithms have been proposed, however ordered XML twig join has been ignored in most of them. In this paper we design a novel algorithm called OTJFast to process ordered xml twig joins efficiently which only need to access the elements of the leaf query nodes. Experimental results show the benefits of our algorithm in term of the size of intermediate results, the number of element reads and the execution time.
引用
收藏
页码:1289 / 1294
页数:6
相关论文
共 14 条
[1]   Structural joins: A primitive for efficient XML query pattern matching [J].
Al-Khalifa, S ;
Jagadish, HV ;
Koudas, N ;
Patel, JM ;
Srivastava, D ;
Wu, YQ .
18TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS, 2002, :141-152
[2]  
[Anonymous], P VLDB
[3]  
[Anonymous], 2002, XQUERY 1 0 XML QUERY
[4]  
[Anonymous], 2005, P ACM SIGMOD INT C M
[5]  
BERGLUND A, 2002, XML PATH LANGUAGE XP
[6]  
Bruno N., 2002, P 2002 ACM SIGMOD IN, P310
[7]  
CHEN S, 2006, VLDB
[8]  
LI GL, 2007, DASFAA, P834
[9]  
LU J, 2005, VLDB, P193
[10]  
LU J, 2004, CIKM, P533