动态拓扑排序途径的XForms表单自动计算研究  

XForms automated recalculation based on dynamic topological sorting

作　　者：董东[1] 郭瑞强[1] 高峰[2] 

机构地区：[1]河北师范大学数学与信息科学学院,河北石家庄050016 [2]河北师范大学体育学院,河北石家庄050016

出　　处：《计算机工程与设计》2007年第13期3251-3253,共3页Computer Engineering and Design

摘　　要：XForms被称为下一代的Web表单,XForms中的模型表达了实例数据项间的计算依赖,计算依赖是一个有向无环图,通过动态拓扑排序算法能够维护有向无环图的拓扑顺序,从而实现XForms表单自动重新计算。该算法解决了数据项增加、减少或数据项间计算依赖的增加、减少后需要全部重新计算问题,提高了XForms计算引擎的效率。XForms, a W3C Recommendation, is called the next generation web forms. In XForms model, computation dependencies among instance data items can be represented as a directed acyclic graph （DAG）. A dynamic topological sorting algorithm is presented, which maintains the topological order ofa DAG and implements the recalculation of an XForms form automatically. The algorithm over- comes the problem of rebuilding the entire dependency digraph after additions and deletions of instance data item. Consequently, the efficiency of an XFroms computing engine is improved.

关 键 词：重新计算 动态拓扑排序 表单 WEB应用 有向无环图 

分 类 号：TP317.3[自动化与计算机技术—计算机软件与理论]