基于XQuery的数据集成系统中的查询分解算法

XQucry查询语言使用XML作为抽象数据模型。可以对基于XML的数据源作查询，无论这些数据源是真正的XML文件或者是中间件提供的XML视图。本文研究了以XQuery作为查询语言的数据集成系统中的查询分解算法。在XQucry语言的层次，利用它的语言特点实现了多数据源的查询分解算法。     

基于混合式数据模型的XML查询方案

从数据模型的角度分析了现有XML查询方法存在缺陷的原因,并提出了一种新颖的自导航式XML查询方案.查询方案先对XML数据模型进行了改进,构造了与数据模型相匹配的查询语言和查询算法.其中,数据模型依据XML文档中节点间的语义相关性对节点信息进行聚簇式存储;查询语言则利用简单语法表达复杂语义;查询算法则具备自导航能力,能帮助用户在不完全了解XML文档结构的情况下获得目标信息.     

XML查询的代数表示及其查询优化

本文绘出了一种XML查询的逻辑代数表示,基于这种代数表示作者探讨了在逻辑层面上进行XML查询优化的可能性和方法。文章按以下方式组织,第一部分给出了一种XML数据的模型表示,接着简单描述了在这个模型上的XML查询语言-AnXQL;第二部分是本文的重点,详细描述了XML查询的逻辑代数操作符,并举例说明;第三部分在逻辑层面上探讨了XML查询优化的方法;最后一部分介绍了相关研究工作,并与本文的方法进行了对比。本文是文[8]中基于半结构化数据模型的集成查询处理研究的重要组成部分。     

基于XPath的XML查询优化

随着XML作为Internet上数据表示和交换的标准,如何高效地进行XML数据的查询己经变得越来越重要,许多XML查询语言也随之出现。这些查询语言虽然种类繁多,但都有个共同特征:使用基于XPath数据模型下规则路径表示来查询XML数据。研究表明,当前的关系数据库技术在处理规则路径表示的查询时通常效率不高。文章在介绍了传统的基于遍历树的方法的基础上重点讨论了基于路径分解的查询处理算法,并对选择连接顺序算法提出了基于动态规划思想的改进。     

基于XPath的XML查询优化

随着XML作为Internet上数据表示和交换的标准,如何高效地进行XML数据的查询己经变得越来越重要,许多XML查询语言也随之出现。这些查询语言虽然种类繁多,但都有个共同特征：使用基于XPath数据模型下规则路径表示来查询XML数据。研究表明,当前的关系数据库技术在处理规则路径表示的查询时通常效率不高。 文章在介绍了传统的基于遍历树的方法的基础上重点讨论了基于路径分解的查询处理算法,并对选择连接顺序算法提出了基于动态规划思想的改进,     

一种基于XML的树型代数

为了解决Web仿真中,关系代数这种数据模型的查询功能的局限性.介绍了一种形式化的集合代数(bulk algebra)称为TAX(Tree Algebra for XML,基于XML的树型代数).TAX的数据模型为有标签的有序树组成的森林,它把关系代数和簇聚融合在一起,提出了树节点和完整树,并构造了模式树和证据树,在此基础上定义了一些数据查询操作.通过对TAX的仿真研究,仿真结果表明TAX不仅可以作用于XML的数据,而且还能有效的把这些面对用户的XML查询语言转换成面对XML数据库的高效的查询语言.同时满足数据的直观性、高效的计算性和有效的优化,而且表达了最多的XML查询.     

利用关系表构建XML文档解析的树模型

在对XML文档的数据解析和查询操作研究中,发现树能较好地反映XML文档的层次结构,但其查询效率较低,而关系表是一种适合存储大量数据且有较好查询效率与操作功能的数据结构。给出了一个把树和关系表相结合构建一种存储XML文档的数据模型;在这个模型的解析过程中,采用回调事件式的分段解析方法以减少解析时间和存储空间。这样既能较好保存XML文档的结构特点,又能提高其查询的效率和操作的便利性。通过对大数据量XML文档的解析和操作实验,实验结果证明这种数据模型在处理大型XML文档中具有明显优势。     

基于整枝连接算法的多版本XML文档查询

XML文档采用树型数据模型,XML查询语言通常是一些基于多个元素的选择胃词组成的查询模式。整枝连接方法用来匹配XML查询模式,用相互连接的多栈结构一次性生成匹配结果。但它不支持多版本XML文档,本文就是探讨如何解决这个问题。     

一种新的Web数据模型-EOEM

随着XML的普及，开发具有同时查询XML文档和HTML文档能力的新一代Web查询语言已是当务之急．但现有的Web数据模型存在种种局限．本文提出了一种新的Web数据模型，能够同时支持HTML和XML等半结构化文档的查询．     

一种可更新的查询语言UXQL

数据变换和数据集成等应用需要对XML文档进行更新，而现有的查询语言对此支持不够。提出了一种可更新的XML查询语言UXQL。它具有统一的数据模型，能够同时对多个异构数据源中的文档进行更新和查询操作。同时它的结构简单，可以很方便地实现和优化。详细描述了UXQL的文法和语言成分，并给出了实现框架和应用实例。     

A comparison of two approaches to utilizing XML in parametric databases for temporal data

The parametric data model captures an object in terms of a single tuple. This feature eliminates unnecessary self-join operations to combine tuples scattered in a temporal relation. Despite this advantage, this model is relatively difficult to implement on top of relational databases because the sizes of attributes are unfixed. Since data boundaries are not problematic in XML, XML can be an elegant solution to implement parametric databases for temporal data. There are two approaches to implementing parametric databases using XML: (1) a native XML database with XQuery engine, and (2) an XML storage with a temporal query language. To determine which approach is appropriate in parametric databases, we consider four questions: the effectiveness of XML in modeling temporal data, the applicability of XML query languages, the user-friendliness of the query languages, and system performances of two approaches. By evaluating the four questions, we show that the latter approach is more appropriate to utilizing XML in parametric databases.     

基于面向对象XML数据的索引机制

XML正在迅速成为Internet上信息表示和数据交换的重要标准.而面向对象的特征具有很强的建模能力,将面向对象的概念引入到XML可以提高XML模式语言的建模能力.而现有的索引模式都不支持面向对象XML数据的查询,由此提出了一种基于面向对象XML数据的OOCtree（Object-Oriented compact tree）索引模式,它是一棵包含组级和元素级的两级双向树.组级提供简洁的结构概要和继承信息,可以在查询早期阶段裁剪大量的搜索空间;元素级提供详细的孩子父亲连接关系,可以快速地访问某元素的父亲,极大地提高了查询处理效率.     

Declarative XML Update Language Based on a Higher Data Model

With the extensive use of XML in applications over the Web, how to update XML data is becoming an important issue because the role of XML has expanded beyond traditional applications in which XML is used for information exchange and data representation over the Web. So far, several languages have been proposed for updating XML data, but they are all based on lower, so-called graph-based or tree-based data models. Update requests are thus expressed in a nonintuitive and unnatural way and update statements are too complicated to comprehend. This paper presents a novel declarative XML update language which is an extension of the XML-RL query language. Compared with other existing XML update languages, it has the following features. First, it is the only XML data manipulation language based on a higher data model. Second, this language can express complex update requests at multiple levels in a hierarchy in a simple and flat way. Third, this language directly supports the functionality of updating complex objects while all other update languages do not support these operations. Lastly, most of existing languages use rename to modify attribute and element names, which is a different way from updates on value. The proposed language modifies tag names, values, and objects in a unified way by the introduction of three kinds of logical binding variables: object variables, value variables, and name variables.     

面向对象XML数据查询的代价估计研究

由于XML具有丰富的表达能力、自描述性和灵活性等优点,而面向对象的概念又具有很强的建模能力,将面向对象的概念引入到XML可以提高XML模式语言的建模能力。而面向对象XML数据查询的值匹配条件的查询代价估计问题是一种典型的多元素查询条件的代价估计问题。XML数据的值分布与其他值信息的分布有关,还与XML数据的结构信息有关,很难使用某种单一的代价估计方法。针对以上问题,提出了一种基于直方图,在估计过程中结合查询树结构的代价估计方法。     

The expressive power of temporal relational query languages

The authors consider the representation of temporal data based on tuple and attribute timestamping. They identify the requirements in modeling temporal data and elaborate on their implications in the expressive power of temporal query languages. They introduce a temporal relational data model where N1NF relations and attribute timestamping are used and one level of nesting is allowed. For this model, a nested relational tuple calculus (NTC) is defined. They follow a comparative approach in evaluating the expressive power of temporal query languages, using NTC as a metric and comparing it with the existing temporal query languages. They prove that NTC subsumes the expressive power of these query languages. They also demonstrate how various temporal relational models can be obtained from the temporal relations by NTC and give equivalent NTC expressions for their languages. Furthermore, they show the equivalence of intervals and temporal elements (sets) as timestamps in their model     

How to structure and access XML documents with ontologies

The current hype on Extensible Mark-up Language (XML) produced hundreds of XML-based applications. Many of them offer document type definitions (DTDs) to structure actual XML documents. Access to these documents relies on special purpose applications or on query languages that are closely tied to the document structure. Our approach uses ontologies to derive canonical structures, i.e., DTDs, to access sets of distributed XML documents on a conceptual level. We will show how the combination of conceptual modeling, inheritance, and inference mechanisms with the popularity, simplicity, and flexibility of XML leads to applications providing a broad range of high-quality information.     

Weighted path queries on semistructured databases

Path queries have been extensively used to query semistructured data, such as the Web and XML documents. In this paper we introduce weighted path queries, an extension of path queries enabling several classes of optimization problems (such as the computation of shortest paths) to be easily expressed. Weighted path queries are based on the notion of weighted regular expression, i.e., a regular expression whose symbols are associated to a weight. We characterize the problem of answering weighted path queries and provide an algorithm for computing their answer. We also show how weighted path queries can be effectively embedded into query languages for XML data to express in a simple and compact form several meaningful research problems.     

Efficient Revalidation of XML Documents

We study the problem of schema revalidation where XML data known to conform to one schema must be validated with respect to another schema. Such revalidation algorithms have applications in schema evolution, query processing, XML-based programming languages, and other domains. We describe how knowledge of conformance to an XML Schema may be used to determine conformance to another XML Schema efficiently. We examine both the situation where an XML document is modified before it is revalidated and the situation where it is unmodified