摘要
XML文档的结构查询处理中通常包含判断XML结点间父子关系或祖先-后代关系的结构连接操作。目前,已经提出了一系列有效的结构连接算法,这些结构连接算法大都基于归并的思想,充分利用XML数据结构的特点来减少连接的扫描代价。本文提出了一种新的XML文档树编码方案,并在该编码方案的基础上设计了一种新的结构连接算法StruContact。该算法集成了Holistic Twig的两个结构连接算法(PathStack和TwigStack算法)的功能,实验表明,可有效提高结构连接操作的效率。
The structural join operations of judging the parent-child relationship or ancestor-descendant relationship between XML nodes are always included in the process of structural query of XML document. At present, a series of effective structural join algorithms has been proposed, and almost all of these algorithms are based on merging thought to make use of the best characteristics of XML data structure to reduce the cost of join scanning. This paper presents a new encoding scheme and further designs a structural join algorithm StrucContact. This algorithm integrated the functions of the two structural join algorithms of Holistic Twig （PathStack algorithm and TwigStack algorithm） and the experiments show that it can greatly improve the efficiency of the structural join operations.
出处
《山东科技大学学报（自然科学版）》
CAS
2009年第2期92-96,共5页
Journal of Shandong University of Science and Technology(Natural Science)
基金
山东科技大学"春蕾计划"项目
