摘要
基于B+树,并借鉴XB树的特点设计一种XM L文档的索引方法.索引关键字分为元素关键值和XM L编码的范围.利用元素编码的范围查询,不必在整XM L文档中搜索,提高了查询效率.对于复杂分支查询,提出了拆分成简单查询路径的规则.在结构化连接问题上,提出了不仅要进行祖孙(父子)关系的连接,还要进行兄弟关系的判断,以得到正确的匹配结果.
Designs an indexing method to process XML database query based on B+tree and XB tree. The index includes element's key word and the range of XML number scheme. The indexing method improves query efficiency by avoiding query against the whole XML database. The paper also puts forward a regulation of decomposing complex paths into some simply path and discusses the issue that ancestor-descendant relationships and sibling relationship should be considered together in the structure join.
出处
《福建师范大学学报(自然科学版)》
CAS
CSCD
北大核心
2008年第2期29-32,共4页
Journal of Fujian Normal University:Natural Science Edition
基金
福建省教育厅A类基金资助项目(JA05338)