【作者】 李慧婷； 李建中； 王宏志； 骆吉洲；

【Author】 Li Huiting,Li Jianzhong,Wang Hongzhi,and Luo Jizhou (School of Computer Science and Technology,Harbin Institute of Technology,Harbin 150001)

【机构】 哈尔滨工业大学计算机科学与技术学院；

【摘要】 提出了一种基于F&B索引的XML数据磁盘存储结构LDF&B,并给出其上的一系列查询处理算法.一方面,它摒除了传统存储方法中相同的值信息重复存储带来大量冗余的问题;另一方面,引入的同带索引与反向索引结构大大减少了树的遍历操作和中间结果集的大小,提高了查询处理效率.理论分析与实验结果均表明,提出的算法高效地实现了disk-based F&B中无法处理的含值的查询,分支查询处理效率也得到显著提高,并具有较好的伸缩性.更多还原

【Abstract】 In this paper,a disk-based XML data storage structure LDF&B based on F&B index is proposed,as well as a series of query processing methods are given.On one side,LDF&B wipes off the redundancy caused by repeated storage of the same value information;on the other hand,the index on the tape and inverted index introduced in this storage structure could reduce tree traversal operations as well as intermediate result size,reducing the complexity of query processing prominently.Both theory analysis and experiment results indicate that the method proposed could process efficiently queries with value which could not be processed by disk-based F&B,improves branching path queries processing efficiency greatly,and has good scalability.更多还原