一种基于OB树的XML索引结构  

XML Index Based on Orthogonal B+ Tree

作　　者：杨梅[1] 

机构地区：[1]湖南科技职业学院软件学院,长沙410118

出　　处：《科学技术与工程》2008年第1期242-245,共4页Science Technology and Engineering

基　　金：湖南省教育厅高校科研项目(05D045)资助

摘　　要：对XML数据建立有效的索引,是左右XML数据处理性能的重要因素。对XML的索引技术进行研究,提出一种XML数据结构索引,结合Schema的数据字典提出OB(Orthogonal B+tree)树的存储方式,可快速的确立元素间关系。与XISS相比明显减少元素访问及路径连接次数,从而缩短路径查询的响应时间。Indexing technique is significant for efficient XML data processing. XML indexing technology is anlyzed, and proposed a kind of XML indexing, a new structure that take advantage of DD in schema and storaged with Orthogonal B ＋ tree. This indexing can quickly establish the relationship between the elements. For a path query that can reduce the number of elements visited and the number of joint operations. Experiment results demonstrate that this indexing can process paah queries faster than XISS do.

关 键 词：XML SCHEMA 索引 路径查询 

分 类 号：TP393.092[自动化与计算机技术—计算机应用技术]