摘要： 在XML数据的查询处理过程中，基于区域划分的连接算法在处理XML数据无序和不存在索引时，是一个效率较高的算法。该文利用区域编码的特点对输入集合进行穷尽的递归划分，在划分的代价下，逐步定位祖先-后代的结构关系。使用二分法进行划分后，再完成结构连接，提高了结构连接的效率，实验表明该算法在XML数据的查询处理上是一个有效的方法。
关键词:
XML结构连接,
区域划分,
区域编码
Abstract: In the process of querying and managing XML data, structural join algorithm based on range partition is an efficient algorithm when the XML data are not sorted or indexed. In this paper, this algorithm takes advantage of the region numbering scheme to recursive partition the input sets exhaustively and with the cost of partition, the structural relation between ancestors and offspring can be localized. The partition of dichotomy before structural join enhances the efficiency of join. The experiment indicates that this algorithm is an efficient one when querying and managing XML data.
Key words:
XML structural join,
region partition,
region coding
中图分类号:
张 晶;丁怡心;刘 山. 基于二分法的XML结构连接[J]. 计算机工程, 2007, 33(18): 62-63,6.
ZHANG Jing; DING Yi-xin; LIU Shan. XML Structural Join Based on Dichotomy[J]. Computer Engineering, 2007, 33(18): 62-63,6.