XPath结构连接顺序优化

XQuery是由W3C提出的XML查询语言标准。XPath路径表达式是XQuery的基础,其查询处理的效能在很大程度上决定着XQuery的处理效率。提出了一种基于代价估算的XPath优化技术,基于层次编码对结构连接的执行代价进行估算,并用动态规划方法求解对于该路径表达式最佳的执行顺序;根据计算结果对查询计划树进行重构得到优化的查询计划。对此算法进行了实验测试和分析,结果表明该算法能得到较佳的查询优化效果。     

XQuery的应用分析

XML查询语言XQuery是导航语言XPath的扩展,它是一种语法简单灵活且表现力强大的功能性语言。XQuery与XML数据结构有内在的联系,可以方便地编写业务逻辑,并且本质上就可以操作XML数据。本文对XQuery发展状况的进行了概要介绍,通过查询语言XQuery的主要概念,及XQuery语言在数据查询、转换等方面的应用分析,对XML文档查询语言的实际应用情况作出讨论。     

XQuery的应用分析

XML查询语言XQuery是导航语言XPath的扩展,它是一种语法简单灵活且表现力强大的功能性语言。XQuery与XML数据结构有内在的联系,可以方便地编写业务逻辑,并且本质上就可以操作XML数据。本文对XQuery发展状况的进行了概要介绍,通过查询语言XQuery的主要概念,及XQuery语言在数据查询、转换等方面的应用分析,对XML文档查询语言的实际应用情况作出讨论。     

XML流上的XQuery前缀共享查询

如何在XML流上高效地执行大量复杂XQuery查询是当今研究的热点之一。在数据选择分发等应用中,还希望在解析流的同时尽早地输出查询结果。为此,本文将XQuery查询的路径导航和结果构造两个阶段分别运行于服务器、客户机两端。导航阶段针对XQuery查询定义了扩展的基本XSIEQ机E-XSIEQ（Extended　XML　Stream　Quervwith　Immediate　Evaluation）,它是一种被索引化、基于栈的自动机。在EXSIEQ机上设计应用了TreeBuf（TreeBuffer）算法,它是一种树型提升缓冲的查询算法,算法使用了前缀共享计算的技术,能高效处理XQuery查询,而且能优化XPath查询。实验证明了TreeBuf算法的高效性。     

XQuery在XML流上查询的结构化连接

通过分析XQuery查询与XPath查询的区别与联系,定义了扩展的基本XSIEQ机E-XSIEQ,它是一种被索引化、基于栈的自动机。提出用变量表来收集XPath查询结果,并将这些中间结果组织成原子表集合,结果构造时能够根据原子表元组之间的上下文关系,对原子表集合快速地进行连接。描述了XQuery查询过程中的结构化连接算法,给出了结果构造的时间性能分析。     

XQuery语言查询优化策略研究

XQuery查询语言在XPath路径查询的基础上使用FLWR等表达式实现XML数据的复杂查询或重构。查询优化是查询处理中重要的组成部分。文章提出了两个优化策略：路径的关联优化和FLWOR查询的重写,XMark实验表明能有效提高XQuery查询的执行效率。     

XML数据流上的关键字查询

XML数据流上的XPath & XQuery查询处理是目前研究者关注的热点问题,但由于XPath & XQuery查询语言相对复杂,在不知道模式信息的前提下,用户很难通过已有的查询接口得到自己感兴趣的数据片断,因此如何在数据流模型上根据XML数据的特点为用户提供最友好的查询接口就成为一个亟待解决的问题.针对这个问题,创新地提出了在XML数据流上做关键字查询的问题,给出了最小相关连通子树(SRCT)的概念用于处理返回的结果,并设计了一种新的基于栈的Lookup算法,可以有效解决在XML数据流上进行关键字查询的问题,最后通过实验从不同角度对Lookup算法的各项性能指标进行了验证.     

基于扩展XQuery引擎的空间数据流查询方法研究

针对目前XML数据流处理中通常采用的查询语言XPath和XQuery均不支持空间运算,无法应用到空间数据流处理技术中的问题,设计了一种通过扩展现有商业化XQuery引擎功能基础上的空间数据流检索方法。     

一种关系模式下转换XML文档查询的有效方法*

在用关系数据库进行存储和管理XML数据的系统中,将XQuery查询语句转换为相应的SQL查询语句是一个重要的挑战。且由于这种转换依赖于关系模式生成技术,这就要求各种生成技术构造自己的查询处理器。该方法使得SilkRoute算法适用于更多的技术,并针对存取XML顺序信息的需求,改进了SilkRoute中的数据结构和算法,使之能正确转换基于顺序信息的XQuery查询。     

带Order子句的XQuery在XML流上的查询实现

随着XML的广泛应用,使得作为XML文档查询语言的XQuery成为人们研究的热点问题.将复杂XQuery在XML数据流上的查询应用于服务器/客户端模式来满足高效、实时查询的要求,所实现的XQuery查询原型系统XSIEQ支持嵌套、order子句的多关键字排序等.一次典型的XQuery查询过程可分为XPath查询、查询后处理两个阶段,本文着重描述查询后处理过程,最后给出了XSIEQ和Qizx在查询后处理时间性能上的对比及分析.     

Efficient processing of XPath queries using indexes

A number of indexing techniques have been proposed in recent times for optimizing the queries on XML and other semi-structured data models. Most of the semi-structured models use tree-like structures and query languages (XPath, XQuery, etc.) which make use of regular path expressions to optimize the query processing. In this paper, we propose two algorithms called Entry-point algorithm (EPA) and Two-point Entry algorithms that exploit different types of indices to efficiently process XPath queries. We discuss and compare two approaches namely, Root-first and Bottom-first in implementing the EPA. We present the experimental results of the algorithms using XML benchmark queries and data and compare the results with that of traditional methods of query processing with and without the use of indexes, and ToXin indexing approach. Our algorithms show improved performance results than the traditional methods and Toxin indexing approach.     

基于XML的Web数据模型

在对现有半结构化数据模型分析的基础上,针对这些模型作为Web数据模型的不足,提出一种新的基于XML的Web数据模型——XWDM,它主要解决了Web数据名称异构问题和查询回路问题。     

集成XQuery功能的Xindice数据库

Xindice是一种原生XML数据库,提供了对XML的存储和管理功能.但Xindice只提供了XPath查询语言,不能灵活满足对XML的查询要求.提出了用Java语言实现XQuery的机制,并提出了将其集成到Xindice中的方法,有效地扩充了Xindice的查询功能.     

A survey on XML streaming evaluation techniques

XML is currently the most popular format for exchanging and representing data on the web. It is used in various applications and for different types of data including structured, semistructured, and unstructured heterogeneous data types. During the period, XML was establishing itself, data streaming applications have gained increased attention and importance. Because of these developments, the querying and efficient processing of XML streams has became a central issue. In this study, we survey the state of the art in XML streaming evaluation techniques. We focus on both the streaming evaluation of XPath expressions and of XQuery queries. We classify the XPath streaming evaluation approaches according to the main data structure used for the evaluation into three categories: automaton-based approach, array-based approach, and stack-based approach. We review, analyze, and compare the major techniques proposed for each approach. We also review multiple query streaming evaluation techniques. For the XQuery streaming evaluation problem, we identify and discuss four processing paradigms adopted by the existing XQuery stream query engines: the transducer-based paradigm, the algebra-based paradigm, the automata-algebra paradigm, and the pull-based paradigm. In addition, we review optimization techniques for XQuery streaming evaluation. We address the problem of optimizing XQuery streaming evaluation as a buffer optimization problem. For all techniques discussed, we describe the research issues and the proposed algorithms and we compare them with other relevant suggested techniques.     

Numerical constraints on XML data

Boundaries occur naturally in everyday life. This paper introduces numerical constraints into the framework of XML to take advantage of the benefits that result from the explicit specification of such boundaries. Roughly speaking, numerical constraints restrict the number of elements in an XML data fragment based on the data values of selected subelements. Efficient reasoning about numerical constraints provides effective means for predicting the number of answers to XQuery and XPath queries, the number of updates when using the XQuery update facility, and the number of encryptions or decryptions when using XML encryption. Moreover, numerical constraints can help to optimise XQuery and XPath queries, to exclude certain choices of indices from the index selection problem, and to generate views for efficient processing of common queries and updates.We investigate decision problems associated with numerical constraints in order to capitalise on the range of applications in XML data processing. To begin with we demonstrate that the implication problem is strongly coNP-hard for several classes of numerical constraints. These sources of potential intractability direct our attention towards the class of numerical keys that permit the specification of positive upper bounds. Numerical keys are of interest as they are reminiscent of cardinality constraints that are widely used in conceptual data modelling. At the same time, they form a natural generalisation of XML keys that are popular in XML theory and practice. We show that numerical keys are finitely satisfiable and establish a finite axiomatisation for their implication problem. Finally, we propose an algorithm that decides numerical key implication in quadratic time using shortest path methods.