摘要
XML有环图结构数据的更新算法主要解决动态添加数据节点带来的死锁问题。目前的编码方法只是针对树结构的文档进行编码优化,或者针对树结构进行区间编码,都不能有效解决图结构中的环问题。提出一种将图拆分成子树的编码方法——SCDBS,其基本思想是将图中的环转化成子树,将各个子树合并成一棵与原来图结构等价的树,然后进行编码,从而解决在更新数据编码时出现的死遁环问题。实验证明,SCDBS是一种非常有效的编码方法,在节省时间开销方面表现出良好的性能,是一种实用的解决XML有环图结构的数据更新算法。
The main function of updated algorithm of XML ring-oriented graph-structured datais to solve the dead lock problems in updating datanodes.At present,the encoding algorithms are focus on the encoding optimization for the tree-structured documents,or encoding between regions against the tree-structure,but it doesn＇t work for efficiently solving the ring problem in graph-structure.This paper provided anew encoding algorithm-SCDBS.The main ideaof this algorithm is to transform the rings in graph into sub-trees,then,integrate the sub-trees into one equivalent tree of original graph-structure,and at last,encode the data,so as to solve the dead lock problem encountered in updating the dataencoding.The experiments show that the SCDBS is an efficient encoding algorithm and has good performance in saving time.
出处
《山东科技大学学报（自然科学版）》
CAS
2010年第5期91-96,共6页
Journal of Shandong University of Science and Technology(Natural Science)
基金
山东科技大学"群星计划"项目(qx102036)
