摘要
利用路径表达式导航 XML 查询是 XML 查询语言的共同特点。目前对 XML 路径表达式的计算有两种方法:一种是基于树遍历的方法,一种是路径连接方法。在路径连接方法中路径表达式的计算效率很大程度上依赖于路径表达式的长度。在对 XML 模式反映的完整性约束研究的基础上,本文提出了排他性包含约束的概念;给出了利用排他性包含约束缩短路径表达式的策略和算法,从而降低了路径连接的代价。通过分析比较,这种路径缩短策略是有效可行的。
Navigating XML queries by path expression is the common characteristic of XML query languages. At pres ent, there are two kinds of path expression evaluating methods: one is based on tree traverse and the other is path join. The computing efficiency of path expression mostly depends on it's size in the methods of path join. Based on the study of integrity constraints depicted by XML schemas, the concept of exclusive inclusion constraint is proposed. Meanwhile the paper presents the path shorten strategy and arithmetic applying the concept. The path shorten strategy reduces the path join cost. Analysis and comparison show that the path shorten strategy is efficient and feasible.
出处
《计算机科学》
CSCD
北大核心
2006年第3期129-131,共3页
Computer Science
基金
本文得到了国家自然科学基金(No.60275019)资助
关键词
XML
路径表达式
结构连接
完整性约束
排他性包含约束
优化策略
XML, Path expression, Structural join, Integrity constraint, Exclusive inclusion constreint, Optimizing Strategy