一种改进的可扩展标记语言素数编码方法  

Improved prime number labeling method on XML

作　　者：龚振志[1] 刘海东[2] 胡孔法[1] 达庆利[1] 

机构地区：[1]东南大学经济管理学院,江苏南京210096 [2]扬州大学信息工程学院,江苏扬州225009

出　　处：《计算机集成制造系统》2008年第8期1658-1664,共7页Computer Integrated Manufacturing Systems

基　　金：国家自然科学基金资助项目(60773103;60673060);中国博士后科学基金资助项目(20070420954);江苏省"青蓝工程"基金资助项目~~

摘　　要：在可扩展标记语言的发展过程中,如何有效地查询可扩展标记语言数据已成为一个研究热点。其中如何快速有效地判断两元素是否具有祖先/后裔关系最为关键。目前已有的素数编码方法需要大量素数和大素数,为此提出一种改进的素数编码方法——最多亲兄弟素数,该方法不必每个节点都使用新素数。理论分析和实验表明,最多亲兄弟素数编码方法大大减少了素数的使用量,减小了所用的大素数,加快了可扩展标记语言查询的速度。In the development of the eXensible Markup Language （XML）, effective query of XML documents was a hot issue. It was very important to quickly and effectively judge whether the two elements had relationship of ancestor/descendant. The existing prime number labeling method needed a number of primes and some big primes, therefore, an improved prime number labeling method-most brothers prime was proposed. There was no need to use new prime numbers for each node in this method. Both the theoretical analysis and the experiments showed that the prime numbers and the biggest prime were reduced in the most brothers prime method. So, this improved method facilitated the query process.

关 键 词：可扩展标记语言 祖先/后裔 素数编码 最多亲兄弟素数 

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