检索
E-mail
RSS
作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2013, Vol. 39 ›› Issue (6): 52-55.doi: 10.3969/j.issn.1000-3428.2013.06.010

• 先进计算与数据处理 • 上一篇    下一篇

一种基于同心圆切割的XML编码方案

郭丽红1,2，王 箭1，杜 贺1   

  1. (1. 南京航空航天大学计算机科学与技术学院，南京 210016；2. 南京工程学院通信工程学院，南京 211167)
  • 收稿日期:2012-07-13 出版日期:2013-06-15 发布日期:2013-06-14
  • 作者简介:郭丽红(1975－)，女，博士研究生，主研方向：XML数据管理，XML隐私保护；王 箭，教授、博士生导师；杜 贺，博士研究生
  • 基金项目:
    国家“863”计划基金资助项目(2009AA044601)；江苏省普通高校研究生科研创新计划基金资助项目(CXZZ12_0161)

An XML Encoding Scheme Based on Concentric Circular Cutting

GUO Li-hong 1,2, WANG Jian 1, DU He 1   

  1. (1. College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China; 2. School of Communications Engineering, Nanjing Institute of Technology, Nanjing 211167, China)
  • Received:2012-07-13 Online:2013-06-15 Published:2013-06-14

PDF

797

被引次数

2

摘要： 在可扩展标记语言(XML)文档的查询过程中，为快速判断任意两节点关系，提出一种基于同心圆切割的编码方案。将一棵n层的XML树看作由n个不同半径的同心圆组成，圆心代表根节点，根据兄弟节点等分切割给定区域的思想，将圆半径、角度与标识相结合进行编码。实验结果表明，与DietZ和StratE编码方法相比，该方案可加快节点间关系判断及任一节点在文档中具体定位的速度，时空效率较高。

关键词: 可扩展标记语言, 编码方案, 区间编码, 同心圆

Abstract: 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.

Key words: eXtensible Markup Language(XML), encoding scheme, interval-based encoding, concentric circular

中图分类号: