基于B+树的XML数据查询处理XML Database Query Processing Based on B+ Tree
林智华;陈珊;马亨冰;
摘要(Abstract):
基于B+树,并借鉴XB树的特点设计一种XM L文档的索引方法.索引关键字分为元素关键值和XM L编码的范围.利用元素编码的范围查询,不必在整XM L文档中搜索,提高了查询效率.对于复杂分支查询,提出了拆分成简单查询路径的规则.在结构化连接问题上,提出了不仅要进行祖孙(父子)关系的连接,还要进行兄弟关系的判断,以得到正确的匹配结果.
关键词(KeyWords): XML;B+树;复杂分支查询;结构化连接
基金项目(Foundation): 福建省教育厅A类基金资助项目(JA05338)
作者(Authors): 林智华;陈珊;马亨冰;
参考文献(References):
- [1]Chien Shu-yao,Vagena Zografoula,Zhang Donghui,et al.Efficient structural joins on indexed XML documents[C].Proceedings of the 2002 International conference on Very Large Data Bases,2002:263-274.
- [2]Jiang Haifeng,Lu Hongjun,Wang Wei,et al.XR-tree:indexing XML data for efficient structural joins[C].Proceedings of the 19th International Conference on Data Engineering,2003:253-264.
- [3]Li Hanyu,Lee Mong Li,Hsu Wynne,et al.An evaluation of XML indexes for structural joins[J].SigmodRecord,2004,33(3):253-264.
- [4]Jiang Haifeng,Wei Wang,Lu Hongjun,et al.Holistic twig joins on indexed XML documents[C].Proceedingsof the 2003 International Conference on Very Large Data Bases,2003:273-284.
- [5]王静,孟小峰.以目标为导向的XML路径查询处理[J].软件学报,2005,16(5):827-837.