DocumentCode
3140753
Title
Study on a New Structural Join Algorithm for XML Query
Author
Wu, Shaofei ; Huang, Yuan
Author_Institution
Sch. of Comput. Sci. & Eng., WuHan Inst. of Technol., Wuhan, China
fYear
2009
fDate
15-16 May 2009
Firstpage
417
Lastpage
419
Abstract
With the problem that the cost is too much for temporary sorting or creating index aimed for there is no index or the index is out-of-order of input data sets in most XML structural join methods, the classical Stack-Tree-Desc algorithm and B+ tree index optimization algorithm are analyzed. A new strategy that isnpsilat limited to any external index is proposed and implemented. The experiment results indicate that it out performs Stack-Tree-Desc algorithm.
Keywords
XML; query processing; B+ tree index optimization algorithm; Stack-Tree-Desc algorithm; XML query; structural join algorithm; Algorithm design and analysis; Computer science; Computer science education; Cost function; Data engineering; Educational technology; Encoding; Intelligent structures; Ubiquitous computing; XML; B+ tree; Structural join; XML query;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Ubiquitous Computing and Education, 2009 International Symposium on
Conference_Location
Chengdu
Print_ISBN
978-0-7695-3619-4
Type
conf
DOI
10.1109/IUCE.2009.75
Filename
5222946
Link To Document