摘要
在可扩展标记语言(XML)文档的查询过程中,为快速判断任意两节点关系,提出一种基于同心圆切割的编码方案。将一棵n层的XML树看作由n个不同半径的同心圆组成,圆心代表根节点,根据兄弟节点等分切割给定区域的思想,将圆半径、角度与标识相结合进行编码。实验结果表明,与DietZ和StratE编码方法相比,该方案可加快节点间关系判断及任一节点在文档中具体定位的速度,时空效率较高。
In order to solve the problem about how to judge the relationship between any two nodes in eXtensible Markup Language （XML） document and accomplish the query process quickly, an encoding scheme based on concentric circular cutting is proposed. It takes an XML tree with n-layer as n concentric circles with different radius, in which the centre of a circle stands for the root node, and adopts the idea of cutting the given area equally and the encoding method combining the circle radius with angle to encode the nodes. Experimental result shows that the new encoding scheme is convenient to judge the relationship in any nodes and it can locate any node＇s specific position, much more effective than DietZ and StartE encoding method in time and space efficiency.
出处
《计算机工程》
CAS
CSCD
2013年第6期52-55,共4页
Computer Engineering
基金
国家"863"计划基金资助项目(2009AA044601)
江苏省普通高校研究生科研创新计划基金资助项目(CXZZ12_0161)
关键词
可扩展标记语言
编码方案
区间编码
同心圆
eXtensible Markup Language（XML）
encoding scheme
interval-based encoding
concentric circular
