摘要
通过研究发现Dewey编码在跳过连续的非嵌套的不匹配祖先节点时优于Zhang编码的性质,利用这一性质提出了建立在B+-Tree索引上基于最小差异前缀的结构连接算法。该算法用位操作取得最小差异前缀,从而能高效地跳过连续的非嵌套的不匹配祖先节点。与现有算法必须利用XR-Tree索引才能跳过该类节点相比,基于最小差异前缀的结构连接算法节省了用于XR-Tree索引的多余开销,可大大提高结构连接效率。
Researches show that the Dewey encoding is better than the Zhang encoding in bypassing a series of less nested and non-matching ancestors. According to the feature, and the B＋-Tree index, the paper brings up a new structural join algorithm based on the least differentiated prefix. This algorithm gets the least differentiated prefix by bit operations to effectively bypass a series of less nested and non-matching ancestors. Comparatively speaking, the new algorithm can save much expense than the passing of the structural join through the XR-Tree, and greatly improve the deficiency of the structural join.
出处
《苏州科技学院学报（工程技术版）》
CAS
2008年第2期72-76,共5页
Journal of Suzhou University of Science and Technology （Engineering and Technology）
