CAJ | 학술논문

针对可扩展标记语言( XML)数据的查询与更新问题，提出一种基于左儿子右兄弟节点链式关联的XML动态编码方案。通过左儿子右兄弟节点的链式相关信息，仅需在局部做简单的若干改动，就可实现XML数据的更新，并能方便快速地实现祖先后裔关系、父子关系和兄弟关系等各种轴操作。研究结果表明，该编码方案不仅能高效地支持结构查询，而且编码时间与插入节点的时间也较少，可快速准确地判断XML文档结构树中任意两节点之间的关系，从而避免更新操作带来的编码大量调整问题，且支持XML文档的查询与更新。
침대가확전표기어언( XML)수거적사순여경신문제，제출일충기우좌인자우형제절점련식관련적XML동태편마방안。통과좌인자우형제절점적련식상관신식，부수재국부주간단적약간개동，취가실현XML수거적경신，병능방편쾌속지실현조선후예관계、부자관계화형제관계등각충축조작。연구결과표명，해편마방안불부능고효지지지결구사순，이차편마시간여삽입절점적시간야교소，가쾌속준학지판단XML문당결구수중임의량절점지간적관계，종이피면경신조작대래적편마대량조정문제，차지지XML문당적사순여경신。
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.