XQuery简介及在.Net中的应用

XML是一种通用标记语言,它能对各种数据源的信息内容进行标记,包括结构化和半结构化文档、关系数据库和对象库,不管它们是物理存储在XML中还是通过中间产生展现为XML,都能够智能地使用XML结构化查询语言表达或查询这些类型数据。XQuery是定位于XML的查询语言,它能广泛应用于很多类型的XML数据源。     

Graph queries for data integration using xml

A new visual language, which is called ER-QBE and uses a conceptual model semantics, is proposed for the development of XML views. ER-QBE is based on graph queries that are trees of parametric SQL queries. The ER-QBE language is characterized by formally proved completeness, its expressiveness is higher than that of well-known alternatives, and it supports both relational and object-relational databases. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 171–183, March–April 2008.     

初识XQuery

上期程序员做了数据库专题,主要揭示了数据库技术结合xml的一些发展,本文可看作这一专题的继续,有兴趣的读者在这里可看到一个更为详尽的描述。     

An XML-Based Approach to Publishing and Querying the History of Databases

There is much current interest in publishing and viewing databases as XML documents. The general benefits of this approach follow from the popularity of XML and the tool set available for visualizing and processing information encoded in this universal standard. In this paper, we explore the additional and unique benefits achieved by this approach on temporal database applications. We show that XML with XQuery can provide surprisingly effective solutions to the problem of supporting historical queries on past content of database relations and their evolution. Indeed, using XML, the histories of database relations can be naturally represented by temporally grouped data models. Thus, we identify mappings from relations to XML that are most conducive to modeling and querying database histories, and show that temporal queries that would be difficult to express in SQL can be easily expressed in standard XQuery. This approach is very general, insofar as it can be used to store the version history of arbitrary documents and, for relational databases, it also supports queries on the evolution of their schema. Then, we turn to the problem of supporting efficiently the storage and the querying of relational table histories. We present an experimental study of the pros and cons of using native XML databases, versus using traditional databases, where the XML-represented histories are supported as views on the historical tables.     

基于关系数据库分裂存储的XML文档片段重构*

首先对基于关系数据库分裂存储XML文档的各种方法进行总结,并对X-RESTORE基于关系数据库的XML文档的分裂存储原理和关系存储模式进行介绍;然后对XML查询的三种计算模式进行分析;最后基于X-RESTORE给出一个重构结果文档片段的算法,并对该算法的执行代价进行分析。分析结果显示,X-RESTORE不仅能够有效地支持XML的选择计算模式,而且能够有效地支持XML的抽取计算模式和重构计算模式。     

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

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

BusSEngine: a business search engine

With the emergence of World Wide Web, business’ databases are increasingly being queried directly by customers. The customers may not be aware of the underlying data and its structure, and might have never learned a query language that enables them to issue structured queries. Some of the business’ employees who query the databases may also not be aware of the structure of the data, but they are likely to be aware of some labels of elements containing data. We propose in this article: (1) an XML Keyword-Based search engine for answering business’ customers called BusSEngine-K, and (2) an XML loosely Structured-Based search engine for answering business’ employees called BusSEngine-L. The two engines employ novel context-driven search techniques and are built on top of XQuery search engine. The two engines were evaluated experimentally and compared with three recently proposed XML search engines. The results showed marked improvement.     

面向不确定图的概率可达查询

图的可达性查询被广泛应用于生物网络、社会网络、本体网络、RDF数据库和XML数据库等.由于对数据操作时引入的噪声和错误使这些图数据具有不确定性,已经有大量的针对不确定RDF和XML数据库的研究.文中使用可能世界语义模型构建不确定图,基于该模型,研究了概率可达查询(PR).处理PR查询是#P完全问题,对此文中首先给出一个基本随机算法,可快速地估算出可达概率,并且该值有很高的精确度.进一步,文中为随机算法引入条件分布(称为"条件随机算法"),采用图的不相交路径集和割集作为条件概率分布,因此改进的随机算法可准确地并且是在多项式时间内处理查询.最后基于真实不确定图数据的大量实验结果验证了文中的设计.     

S2CX: From relational data via SQL/XML to (Un-)Compressed XML

The gap between storing data in relational databases and transferring data in form of XML has been closed e.g. by SQL/XML queries that generate XML data out of relational data sources. However, only few relational database systems support the evaluation of SQL/XML queries. And even in those systems supporting SQL/XML, the evaluation of such queries is quite slow compared to the evaluation of SQL queries. In this paper, we present S2CX, an approach that allows to efficiently evaluate SQL/XML queries on any relational database system, no matter whether it supports SQL/XML or not. As a result to an SQL/XML query, S2CX supports different output formats ranging from plain XML to different compressed XML representations including a succinct encoding of XML data, schema-aware compressed XML to grammar compressed XML. In many cases, S2CX produces compressed XML as a result to an SQL/XML query even faster than the evaluation of SQL/XML queries into non-compressed XML as provided by Oracle 11 g and by DB2. Furthermore, our approach to query evaluation scales better, i.e., the larger the dataset, the faster is our approach compared to SQL/XML query evaluation in Oracle 11 g and in DB2.     

A Query Language for XML Based on Graph Grammars

In this paper we present a graphical query language for XML. The language, based on a simple form of graph grammars, permits us to extract data and reorganize information in a new structure. As with most of the current query languages for XML, queries consist of two parts: one extracting a subgraph and one constructing the output graph. The semantics of queries is given in terms of graph grammars. The use of graph grammars makes it possible to define, in a simple way, the structural properties of both the subgraph that has to be extracted and the graph that has to be constructed. We provide an example-driven comparison of our language w.r.t. other XML query languages, and show the effectiveness and simplicity of our approach.     

XML materialized views and schema evolution in VIREX

Web-based databases are gaining increased popularity. This has positively influenced the availability of structured and semi-structured databases for access by a variety of users ranging from professionals to naive users. The number of users accessing online databases will continue to increase if the visual tools connected to web-based databases are flexible and user-friendly enough to meet the expectations of naive users and professionals. Further, XML is accepted as the standard for platform independent data exchange. This motivated for the development of the conversion tools between structured databases and XML. Realizing that such a need has not been well handled by the available tools, including Clio from IBM, we developed VIREX as a visual tool for converting relational databases into XML, and since then has been empowered with further capabilities to manipulate the produced XML schema including the maintenance of materialized views and schema evolution functions. VIREX provides an interactive approach for querying and integrating relational databases to produce XML documents and the corresponding XML schema(s). VIREX supports VRXQuery as a visual naive users-oriented query language that allows users to specify queries and define views directly on the interactive diagram as a sequence of mouse clicks with minimum keyboard input. As the query result, VIREX displays on the screen the XML schema that satisfies the specified characteristics and generates colored (easy to read) XML document(s). The main contribution described in this paper is the novel approach for turning query results into materialized views which are maintained to remain consistent with the underlying database. VIREX supports deferred update of XML views by keeping an ordered summary of the necessary and sufficient information required for the process. Each view has a corresponding marker in the ordered summary to indicate the start of the information to be reflected onto the view when it is accessed. When a view is accessed, its marker moves to the head of the list to mark for the next update. In addition, VIREX supports some basic schema evolution functions include renaming, adding and dropping of elements and attributes, among others. The supported schema evolution functions add flexibility to the view maintenance and materialization process.     

ArchIS: an XML-based approach to transaction-time temporal database systems

Effective support for temporal applications by database systems represents an important technical objective that is difficult to achieve since it requires an integrated solution for several problems, including (i) expressive temporal representations and data models, (ii) powerful languages for temporal queries and snapshot queries, (iii) indexing, clustering and query optimization techniques for managing temporal information efficiently, and (iv) architectures that bring together the different pieces of enabling technology into a robust system. In this paper, we present the ArchIS system that achieves these objectives by supporting a temporally grouped data model on top of RDBMS. ArchIS’ architecture uses (a) XML to support temporally grouped (virtual) representations of the database history, (b) XQuery to express powerful temporal queries on such views, (c) temporal clustering and indexing techniques for managing the actual historical data in a relational database, and (d) SQL/XML for executing the queries on the XML views as equivalent queries on the relational database. The performance studies presented in the paper show that ArchIS is quite effective at storing and retrieving under complex query conditions the transaction-time history of relational databases, and can also assure excellent storage efficiency by providing compression as an option. This approach achieves full-functionality transaction-time databases without requiring temporal extensions in XML or database standards, and provides critical support to emerging application areas such as RFID.     

DVQ: Towards Visual Query Processing of XML Database Systems

XML has been recognized as a promising language for data exchange over the Internet. A number of query languages have been proposed for querying XML data. Most of those languages are path-expression based. One difficulty in forming path-expression based queries is that users have to know the structure of XML data against which the queries were issued. In this paper, we describe a DTD-driven visual query interface for XML database systems. With such an interface, a user can easily form path-expression based queries by clicking elements in the DTD tree displayed on the screen and supplying conditions if necessary. The interface and the query generation process are described in detail.     

XML-based data processing in network supported collaborative design

In the course of network supported collaborative design, the data processing plays a very vital role. Much effort has been spent in this area, and many kinds of approaches have been proposed. Based on the correlative materials, this paper presents extensible markup language(XML)based strategy for several important problems of data processing in network supported collaborative design, such as the representation of standard for the exchange of product model data(STEP)with XML in the product information expression and the management of XML documents using relational database. The paper gives a detailed exposition on how to clarify the mapping between XML structure and the relationship database structure and how XML-QL queries can be translated into structured query language(SQL) queries. Finally, the structure of data processing system based on XML is presented.     

基于DTD的XML与SQL查询转换算法

针对如何将XML查询转换成SQL查询提出了一个XSLT查询到SQL查询的转换框架和算法，研究了文档类型定义(DTD)和关系模式的相互映射方法及基于XML DTD且不使用任何中间语言将XSLT查询转换为SQL查询的具体过程和算法：从XSLT代码中抽取指令集合，合并、简化并分割其中的XPath，最后抽取出SQL语句的各个组成部分。该算法具有较高的通用性。     

一种Native-XML数据库的模型实现

本文根据XML的特性，结合对传统数据库的研究，提出了一种Native-XML数据库原型的逻辑模型，并给出了一种查询方法。这种技术可以扩展数据库的应用面，大大提高特殊查询的效率，弥补传统关系数据库的不足。     

Locating XML Documents in a Peer-to-Peer Network Using Distributed Hash Tables

One of the key challenges in a peer-to-peer (P2P) network is to efficiently locate relevant data sources across a large number of participating peers. With the increasing popularity of the extensible markup language (XML) as a standard for information interchange on the Internet, XML is commonly used as an underlying data model for P2P applications to deal with the heterogeneity of data and enhance the expressiveness of queries. In this paper, we address the problem of efficiently locating relevant XML documents in a P2P network, where a user poses queries in a language such as XPath. We have developed a new system called psiX that runs on top of an existing distributed hashing framework. Under the psiX system, each XML document is mapped into an algebraic signature that captures the structural summary of the document. An XML query pattern is also mapped into a signature. The query's signature is used to locate relevant document signatures. Our signature scheme supports holistic processing of query patterns without breaking them into multiple path queries and processing them individually. The participating peers in the network collectively maintain a collection of distributed hierarchical indexes for the document signatures. Value indexes are built to handle numeric and textual values in XML documents. These indexes are used to process queries with value predicates. Our experimental study on PlanetLab demonstrates that psiX provides an efficient location service in a P2P network for a wide variety of XML documents.     

基于Agent和XML的Web页面信息抽取研究与设计

在以前相关研究的基础上，提出了一个建立在Agent和XML基础上的Web页面信息抽取的原型系统。在这个原型系统里，利用Agent的自治能力和合作能力来协助用户对抽取请求进行公式化表述和结合知识库学习抽取规则等。另外，系统还用XML语言描述抽取请求和抽取规则，在其中加入一些语义信息，这些语义信息可被有效利用，从而提高抽取的精确性。     

XML queries and algebra in the Enosys integration platform

We describe the Enosys XML integration platform, focusing on the query language, algebra, and architecture of its query processor. The platform enables the development of eBusiness applications in customer relationship management, e-commerce, supply chain management, and decision support. These applications often require that data be integrated dynamically from multiple information sources. The Enosys platform allows one to build (virtual and/or materialized) integrated XML views of multiple sources, using XML queries as view definitions. During run-time, the application issues XML queries against the views. Queries and views are translated into the XCQL algebra and are combined into a single algebra expression/plan. Query plan composition and query plan decomposition challenges are faced in this process. Finally, the query processor lazily evaluates the result, using an appropriate adaptation of relational database iterator models to XML. The paper describes the platform architecture and components, the supported XML query language and the query processor architecture. It focuses on the underlying XML query algebra, which differs from the algebras that have been considered by W3C in that it is particularly tuned to semistructured data and to optimization and efficient evaluation in a system that follows the conventional architecture of database systems.     

Storing and querying fuzzy XML data in relational databases

Information imprecision and uncertainty exist in many real-world applications and for this reason fuzzy data management has been extensively investigated in various database management systems. Currently, introducing native support for XML data in relational database management systems (RDBMs) has attracted considerable interest with a view to leveraging the powerful and reliable data management services provided by RDBMs. Although there is a rich literature on XML-to-relational storage, none of the existing solutions satisfactorily addresses the problem of storing fuzzy XML data in RDBMs. In this paper, we study the methodology of storing and querying fuzzy XML data in relational databases. In particular, we present an edge-based approach to shred fuzzy XML data into relational data. The unique feature of our approach is that no schema information is required for our data storage. On this basis, we present a generic approach to translate path expression queries into SQL for processing XML queries.