摘要
针对以前兄弟位置关系的结构连接需要索引才能获得较好性能的情况,提出了扩展的EX-Dietz编码方案.该编码方案把每个结点译码为4元组,包含了兄弟位置的初始信息.利用该编码可以有效判断结点的兄弟位置关系,并利用队列数据结构,只需要扫描一次P和F列表,就可以实现基于该编码的兄弟位置关系的结构连接计算.实验结果显示,该方法具有较好的时间性能.
Structural join was a crucial operation for XML querying,but the relation of XML document position was scarcely researched.The paper put forward an algorithm of extensible Dietz coding,in which each node was coded in-to a group of 4 elements,each involving the initial information of sibling positions.The EX-Dietz coding can help judge effectively the relation of node′s sibling positions.The coding-based calculation of the structural join of sibling positions can be achieved by using queue data and scanning P and F lists.The results show that the algorithm has a good time performance.
出处
《南通大学学报（自然科学版）》
CAS
2009年第1期26-28,共3页
Journal of Nantong University(Natural Science Edition)
基金
湖南省教育厅科学研究项目(06C658)
关键词
XML
扩展区间编码
兄弟位置
结构连接
XML
extensible region coding
sibling positions
structural join
