Computer Science ›› 2010, Vol. 37 ›› Issue (3): 182-187204.
Previous Articles Next Articles
XU Xiao-shuang,FENG Yu-cai,WANG Feng,ZHOU Ying-biao,ZHANG Jun
Online:
Published:
Abstract: Effectively storing and querying XMI. 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 XMI_ 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 structurcconstraincd nodes, so structural joins extremely decreases. The results of experimenu indicate the algorithm can significantly filter useless elements and improve the performance for twig queries.
Key words: XML, Twig query, Structural j oin, Path summary
XU Xiao-shuang,FENG Yu-cai,WANG Feng,ZHOU Ying-biao,ZHANG Jun. Path-partitioned Encoding Optimizes Twig Queries[J].Computer Science, 2010, 37(3): 182-187204.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jsjkx.com/EN/
https://www.jsjkx.com/EN/Y2010/V37/I3/182
Cited