基于相关性语义的高效xmltwig查询处理方法-中国人民大学.pdfVIP

第 43 卷 增刊 计 算 机 研 究 与 发 展 Vol.43, Suppl. 2008 年 11 月 JOURNAL OF COMPUTER RESEARCH AND DEVELOPMENT Nov. 2008 基于相关性语义的高效 XML Twig 查询处理方法 1 1 1,2 1 朱金清 王伟 周军锋 孟小峰 1 ( 中国人民大学信息学院 北京 100872) 2 (燕山大学计算机科学与工程系 秦皇岛 066004) (zhujinqing@) 摘要 作为互联网上数据的表示和交换事实上的标准, XML 已经广泛应用于许多领域.虽然关键字查询方法容易使用,但其表达能 力有限;而结构化查询语言在用户不了解模式信息的前提下无法正确地表达查询.提出一种基于相关性(related)语义来扩充 XPath 的表达能力,使得用户在不了解文档模式的情况下可以轻松表达自身的查询请求.提出基于related 语义的XML Twig 查询处理方法 rTwigStack,可以高效处理包含related 语义的查询,在此基础上,提出基于 DTD 模式的优化算法 rTwigStack+来提高查询效率.通过实 验根据不同的性能指标对本文提出的查询算法进行了实验验证. 关键词 XML 数据库, 查询处理, 相关性语义, Twig 模式 中图法分类号 TP391 Efficient Processing of XML Twig Pattern Based on Related Semantics 1 1,2 1 1 Zhu Jinqing , Zhou Junfeng , Wang Wei , Meng Xiaofeng 1 (School of Information, Renmin University of China, Beijing 100872) 2 (Department of Computer Science and Engineering, Yanshan University, Qinhuangdao 066004) Abstract As a de facto standard for information representation and exchange over the internet, XML has been used extensively in many applications. Though keyword search method can be used easily, it possesses the inherit feature of limited expressive capability. Structured query language has the powerful expressive ability, however, users must have a full understanding of the underneath schema information. We propose an extension to XPath by introducing a novel related semantics, which can help user to express their query requirements even if they are not familiar with the schema knowledge. We then propose an efficient algorithm, rTwigStack, to process a twig query involving related axis, and an optimized algorithm, rTwigStack+, based on DTD schema, to improve