XML层次信息搜索空间效率的改进研究

Improvement on efficiency of XML level information search space

实现了XML层次信息搜索空间效率的提高,采用了HBA算法完成检索设计,主要做了以下工作:理论上阐述了LAF编码二层索引的空间效率特点;设计了采用最大值堆作为第一层的HBA算法;完成了算法的伪代码等详细设计;以输入查询Q(Yu,Yannis)完成了设计的举例论述。采用1个人工和4个真实的数据集构成的对比实验表明:通过DOM标准的算法周游方式更为简洁、直接;LAF编码的二层索引在空间效率上比一些传统的方法明显更高;传统的Scan Eager算法的时间效率显然不如HBA算法;只要满足平均深度大于4、关键词可以均匀的分布条件,设计的算法空间效率优势明显。这一研究对XML信息搜索的进一步改进具有明显的借鉴意义。

This paper achieves improvement on efficiency ol XML level information search space, it completes the design using HBA algorithm. It elaborated LAF code ol second level ol index space effiency characteristics,designed the maximum value in the heap as first level ol HBA algorithm, implemented the algorithm pseudo code;the input query Q completed the practical example. The contrast experiments with 1 human and 4 real data sets show the algorithm is more concise and direct; the 2 level index of LAF coding is more efficient than some traditional methods; the time efficiency of the traditional scan Eager algorithm is obviously not as good as the HAB algorithm. As long as the average depth is greater than 4, the key words can be uniform distribution couditions, the design of the algorithm has obvious advantages in space efficiency. This study has significant implications for the further improvement of XML information search.