基于XQuery实现XML高效查询的分析研究

当愈来愈多的数据资料以XML为标准格式进行存储时,由于其格式的不同而导致传统的数据库及查询语法无法适用,该文分析了一种全新的XML查询语言XQuery,并对其在相关领域的应用作了介绍和比较。最后,对XQuery的芡展前景作出展望。     

基于XQuery实现XML高效查询的分析研究

当愈来愈多的数据资料以XML为标准格式进行存储时,由于其格式的不同而导致传统的数据库及查询语法无法适用,该文分析了一种全新的XML查询语言XQuery,并对其在相关领域的应用作了介绍和比较。最后,对XQuery的发展前景作出展望。     

XML数据查询语言XQuery应用分析

目前,XML已经成为事实上的数据表示和数据交换标准,XQuery是用来对XML文档进行数据查询的W3C候选推荐标准。结合XQuery规范的最新发展状况,介绍XQuery查询语言的主要特性,通过实例讨论XQuery语言在数据查询、转换等方面的应用。对SQL/XML和Xquery进行了比较,并分析了XQuery的实现与应用情况。     

XFlat: Query-friendly encrypted XML view publishing

The security of published XML data receives exceptional attention due to its sensitive nature in many applications. This paper proposes an XML view publishing method called XFlat. Compared with other methods, XFlat focuses on query performance over the published XML view while simultaneously protecting the sensitive data via encryption techniques. XFlat decomposes an XML tree into a set of sub-trees, in each of which multiple users have the same accessibility to all nodes, and may encrypt and store each sub-tree in a flat, sequential manner. This storage strategy can avoid the nested encryption cost in view construction and the nested decryption cost in query evaluation. In addition, we discuss how to generate a user-specific schema and how to minimize the total space cost of the published XML view when considering the overhead of the relationships among the sub-trees. We also propose an XML schema index to enhance query performance over the final XML view. The experimental results demonstrate the effectiveness and efficiency of the proposed XFlat method.     

A system for securing push-based distribution of XML documents

Push-based systems for distributing information through Internet are today becoming more and more popular and widely used. The widespread use of such systems raises non trivial security concerns. In particular, confidentiality, integrity and authenticity of the distributed data must be ensured. To cope with such issues, we describe here a system for securing push distribution of XML documents, which adopts digital signature and encryption techniques to ensure the above mentioned properties and allows the specification of both signature and access control policies. We also describe the implementation of the proposed system and present an extensive performance evaluation of its main components.     

Efficiently supporting order in XML query processing

XML is an ordered data model and XQuery expressions return results that have a well-defined order. However, little work on how order is supported in XML query processing has been done to date. In this paper we study the issues related to handling order in the XML context, namely challenges imposed by the XML data model, the variety of order requirements of the XQuery language, and the need to maintain order in the presence of updates to the XML data. We propose an efficient solution that addresses all these issues. Our solution is based on a key encoding for XML nodes that serves as node identity and at the same time encodes order. We design rules for encoding order of processed XML nodes based on the XML algebraic query execution model and the node key encoding. These rules do not require any actual sorting for intermediate results during execution. Our approach enables efficient order-sensitive incremental view maintenance as it makes most XML algebra operators distributive with respect to bag union. We prove the correctness of our order encoding approach. Our approach is implemented and integrated with Rainbow, an XML data management system developed at WPI. We have tested the efficiency of our approach using queries that have different order requirements. We have also measured the relative cost of different components related to our order solution in different types of queries. In general the overhead of maintaining order in our approach is very small relative to the query processing time.     

To secure XML documents with the extension function of XSLT

XSLT is a very popular and flexible language for transforming XML documents which provides a powerful implementation of a tree‐oriented transformation language for transmuting instances of XML using a single vocabulary into a desired output. In this paper, we propose a processing model that enables the XSLT processor to encrypt and decrypt XML documents. The details of the implementation are presented. Our model supports a more general encryption scope than previous models. The implementation and experimental results demonstrate the practicality of the proposed model. Copyright © 2006 John Wiley & Sons, Ltd.     

Secure query processing against encrypted XML data using Query-Aware Decryption

Dissemination of XML data on the internet could breach the privacy of data providers unless access to the disseminated XML data is carefully controlled. Recently, the methods using encryption have been proposed for such access control. However, in these methods, the performance of processing queries has not been addressed. A query processor cannot identify the contents of encrypted XML data unless the data are decrypted. This limitation incurs overhead of decrypting the parts of the XML data that would not contribute to the query result. In this paper, we propose the notion of Query-Aware Decryption for efficient processing of queries against encrypted XML data. Query-Aware Decryption allows us to decrypt only those parts that would contribute to the query result. For this purpose, we disseminate an encrypted XML index along with the encrypted XML data. This index, when decrypted, informs us where the query results are located in the encrypted XML data, thus preventing unnecessary decryption for other parts of the data. Since the size of this index is much smaller than that of the encrypted XML data, the cost of decrypting this index is negligible compared with that for unnecessary decryption of the data itself. The experimental results show that our method improves the performance of query processing by up to six times compared with those of existing methods. Finally, we formally prove that dissemination of the encrypted XML index does not compromise security.     

Dynamic interval-based labeling scheme for efficient XML query and update processing

XML data can be represented by a tree or graph structure and XML query processing requires the information of structural relationships among nodes. The basic structural relationships are parent-child and ancestor-descendant, and finding all occurrences of these basic structural relationships in an XML data is clearly a core operation in XML query processing. Several node labeling schemes have been suggested to support the determination of ancestor-descendant or parent-child structural relationships simply by comparing the labels of nodes. However, the previous node labeling schemes have some disadvantages, such as a large number of nodes that need to be relabeled in the case of an insertion of XML data, huge space requirements for node labels, and inefficient processing of structural joins. In this paper, we propose the nested tree structure that eliminates the disadvantages and takes advantage of the previous node labeling schemes. The nested tree structure makes it possible to use the dynamic interval-based labeling scheme, which supports XML data updates with almost no node relabeling as well as efficient structural join processing. Experimental results show that our approach is efficient in handling updates with the interval-based labeling scheme and also significantly improves the performance of the structural join processing compared with recent methods.     

一种基于关键字的XML文档查询算法

对XML文档查询的常用方法有两种：一种是使用查询语言;另一种是使用关键字,而使用关键字查询XML文档比使用查询语言更为简单方便。给出了一种使用关键字查询XML文档的索引查找算法。该算法只需要扫描一次关键字对应的编码列,就可以找到需要的编码,提高了查询效率。实验表明该算法是可行的和有效的。     

高效查询的XML编码方案

在XML数据查询中,结构连接操作占用了大量时间。针对这个问题,提出一种高效查询的编码方案—LSEQ编码。它将节点路径信息进行分解,避免记录路径的重复信息,减小了编码长度;同时支持节点祖先后代关系,父子关系和兄弟关系的表示。LSEQ编码通过记录非叶节点的路径,在节点查询中避免了结构连接操作,提高了查询效率。实验表明LSEQ编码提高了空间利用率,在查询速度上具有出良好的性能。     

Indexing XML documents for XPath query processing in external memory

Existing encoding schemes and index structures proposed for XML query processing primarily target the containment relationship, specifically the parent–child and ancestor–descendant relationship. The presence of preceding-sibling and following-sibling location steps in the XPath specification, which is the de facto query language for XML, makes the horizontal navigation, besides the vertical navigation, among nodes of XML documents a necessity for efficient evaluation of XML queries. Our work enhances the existing range-based and prefix-based encoding schemes such that all structural relationships between XML nodes can be determined from their codes alone. Furthermore, an external-memory index structure based on the traditional B+-tree, XL+-tree(XML Location+-tree), is introduced to index element sets such that all defined location steps in the XPath language, vertical and horizontal, top-down and bottom-up, can be processed efficiently. The XL+-trees under the range or prefix encoding scheme actually share the same structure; but various search operations upon them may be slightly different as a result of the richer information provided by the prefix encoding scheme. Finally, experiments are conducted to validate the efficiency of the XL+-tree approach. We compare the query performance of XL+-tree with that of R-tree, which is capable of handling comprehensive XPath location steps and has been empirically shown to outperform other indexing approaches.     

XML查询的推理审计

XML文档作为一种网上信息交换方式,其应用越来越广泛．信息发布的安全性给数据库带来新的挑战,目前一些安全策略以法律条文形式颁布,这要求采用有效的手段证实对XML文档的访问与安全策略的一致性．审计能达到这样的目的,但已有的审计方法只能对SQL查询结果进行审计,不能对XML文档查询——XQuery或Xpath进行审计,且蓄意破坏的用户可能通过对查询结果进行推理来访问敏感信息,这就要求对XQuery的审计必然同时具备推理能力．对此,首先提出了可靠而可行的XQuery审计方法、算法及相应查询图模型（QGM）;为使审计具备基本的推理能力,针对XML文档的几种典型约束,给出了推理审计方法、算法及相应查询图模型;实验结果表明,给出的XML查询推理审计框架切实可行．     

I-XISS：一种改进的XML文档索引结构

节点索引是XML索引中可支持正则路径表达式的最具代表性的一种，但是对于长的查询路径表达式，尤其是在中间结果很多的时候，节点索引的连接操作代价很高。对节点索引的索引结构进行了改进，通过减少中间结果的连接次数，使得查询时间与路径的长度无关，而只与路径的复杂度有关，并且提出了一种利用该索引结构输出查询结果的算法。     

一种改进的XML查询重写算法研究

查询重写是数据集成的一个关键问题,它是将用户的查询请求自动重写为直接面向数据源的查询请求。最近Michigan大学和IBM的AImaden研究中心提出了一种新的基于约束的XML查询重写算法,但是该算法没有考虑复杂模式匹配重写问题,使得该算法应用受到限制。在原来的算法重写思想基础上,提出了一种改进的XML查询重写算法,扩大原算法的应用范围,并分析了改进算法的正确性和时间复杂度。     

基于XML的案例推理技术及其在生产调度中的应用研究

在广泛应用的案例推理技术中,非结构化案例占重要地位。针对非结构化案例的特点和相应的检索、匹配与推理机制,本文提出了基于XML的非结构化案例表示与推理技术。以天然气生产调度为例,详细介绍了非结构化案例的XML表示以及基于XQuery的案例检索、匹配与例修正过程。     

An efficient XML encoding and labeling method for query processing and updating on dynamic XML data

In this paper, we propose an efficient encoding and labeling scheme for XML, called EXEL, which is a variant of the region labeling scheme using ordinal and insert-friendly bit strings. We devise a binary encoding method to generate the ordinal bit strings, and an algorithm to make a new bit string inserted between bit strings without any influences on the order of preexisting bit strings. These binary encoding method and bit string insertion algorithm are the bases of the efficient query processing and the complete avoidance of re-labeling for updates. We present query processing and update processing methods based on EXEL. In addition, the Stack-Tree-Desc algorithm is used for an efficient structural join, and the String B-tree indexing is utilized to improve the join performance. Finally, the experimental results show that EXEL enables complete avoidance of re-labeling for updates while providing fairly reasonable query processing performance.     

XML Schema制导的多媒体检索系统设计与实现

针对基于内容的检索技术在高层语义检索方面的不足,论文提出了一种通过XML大纲(schema)制导进行多媒体标注和检索的方法,即首先以schema来定义多媒体数据的结构,然后以schema制导的方法对多媒体内容进行标注和检索,并尝试采用基于SMIL的技术来实现检索结果的超媒体合成。为实现通用性,提出了schema制导树生成的一般算法,以及检索条件到XQuery查询语句的转换方法,最后描述了一个该方法的具体实现——Schema制导的多媒体标注和检索系统SDMMRS。     

An efficient algorithm of frequent XML query pattern mining for ebXML applications in e-commerce

Providing efficient query to XML data for ebXML applications in e-commerce is crucial, as XML has become the most important technique to exchange data over the Internet. ebXML is a set of specifications for companies to exchange their data in e-commerce. Following the ebXML specifications, companies have a standard method to exchange business messages, communicate data, and business rules in e-commerce. Due to its tree-structure paradigm, XML is superior for its capability of storing and querying complex data for ebXML applications. Therefore, discovering frequent XML query patterns has become an interesting topic for XML data management in ebXML applications. In this paper, we present an efficient mining algorithm, namely ebXMiner, to discover the frequent XML query patterns for ebXML applications. Unlike the existing algorithms, we propose a new idea by collecting the equivalent XML queries and then enumerating the candidates from infrequent XML queries in our ebXMiner. Furthermore, our simulation results show that ebXMiner outperforms other algorithms in its execution time.     

基于本体和XML的数据交换研究

介绍了基于本体和XML的数据交换系统的构造方法,通过用本体描述特定领域中的概念及其之间的关系,并用本体信息标记数据模型,使数据模型不仅具有结构信息,还具有了语义信息,为实现语义完整的数据转换提供了支持并方便了数据转换中的查询重组处理。