摘要
XML文档的路径查询通常是节点间关系的判断,其中最主要的是祖先、子孙关系的判断。该文通过借鉴R树的构造特点提出了一种新的基于R树的XML数据库的索引机制,解决了快速判断XML文档中节点间祖先、子孙关系的问题。
Path query of XML document is generally the judgement of the relation between nodes,however,the judge-ment of ancestor-descendant relationship lies in the core.By referring to the R-tree-structural characteristic,this paper puts forward a new R-tree based index mechanism for XML database,solving the problem of quickly determining the relationship of ancestor and descendant between the nodes.
出处
《计算机工程与应用》
CSCD
北大核心
2005年第2期171-172,226,共3页
Computer Engineering and Applications
基金
国家863高技术研究发展计划项目(编号:2002AA4Z3110)
湖北省科技攻关计划安全数据库管理系统(编号:2002AA103A06)
