摘要： 针对可扩展标记语言(XML)数据的查询与更新问题,提出一种基于左儿子右兄弟节点链式关联的XML动态编码方案。通过左儿子右兄弟节点的链式相关信息,仅需在局部做简单的若干改动,就可实现XML 数据的更新,并能方便快速地实现祖先后裔关系、父子关系和兄弟关系等各种轴操作。研究结果表明,该编码方案不仅能高效地支持结构查询,而且编码时间与插入节点的时间也较少,可快速准确地判断XML 文档结构树中任意两节点之
间的关系,从而避免更新操作带来的编码大量调整问题,且支持XML 文档的查询与更新。
关键词:
可扩展标记语言,
文档树,
编码方案,
轴操作,
数据查询,
数据更新
Abstract: Aiming at the problem of eXtensible Markup Language(XML) data query and update,this paper proposes a
dynamic XML coding scheme based on left son and right sibling node chain association. According to the chain related information about brother node,only by doing some simple changes in local,it can realize unlimited updates of XML data and the ancestor descendant relationships,parent-child relationship and sibling relationships and other axis operation. The results show that the proposed coding scheme not only efficiently supports structure query,but also has less coding time and insert node time. It can fast and accurately determine the relationship between any XML document structure tree nodes,so as to avoid a lot of code adjustment problems the update brings,and it efficiently supports the query and update of XML documents.
Key words:
eXtensible Markup Language ( XML ),
document tree,
coding scheme,
axis operation,
data query,
data update
中图分类号: