XML压缩算法的分析与比较

XML为在Web上发布和交换异质数据提供了相当的灵活性。但由于这种语言自身就有冗余的特性所以XML文档在体积都大于有相同数据内容的其他类型的文档。随着XML在Web上应用的扩展其数据大小自然也会随之而增加,而这实质上增加了数据的存储量、处理量和交换量,因此XML文档的体积问题也阻碍了XML的应用,特别是阻碍了XML在具有带宽和内存容量限制的应用上如移动通讯应用。在这篇文章中,我们将大致的介绍一下最近提出的几种针对XML的压缩算法并分析它们在解决XML文档体积问题上的技术和效能。     

XML 压缩方法的比较分析

搜集近几年提出的各种XML压缩方法,比较、分析具有代表性的XML压缩技术。实验表明,XMill拥有出色的压缩率、较少的压缩与解压时间、较低的内存消耗,以及最优的平均压缩性能,但不支持对压缩文档的直接查询。XGRIND与XPRESS的压缩性能不如XMill,却能较好地支持对压缩文档的直接查询。总结XML压缩方法各自的优点和不足,并探讨未来努力的方向。     

XML文档压缩技术比较研究

XML已经成为互联网上信息交换和信息表示的事实标准。然而XML文档中包含大量重复出现的标签和结构等冗余信息,导致XML文档在查询处理和数据交换时付出更高的代价,特别在带宽和资源受限的设备上显得更为突出。压缩技术是解决这一问题的重要途径。搜集了近几年提出的各种XML压缩方法,从压缩率、压缩与解压时间、内存消耗、查询性能等方面比较分析了六个具有代表性的XML压缩技术,最后简要归纳了各自的优点和存在的不足,并探讨未来努力的方向。     

XML压缩文档上的数值更新方法

近年来,XML已成为Web上信息交流和资源共享的主要载体。但XML自身的自冗余特性限制了它的普遍应用。目前,已经有研究成果提出了XML的压缩方法。压缩的XML文档能够有效利用存储空间,节省网络带宽。在实际应用中,经常需要对压缩存储的XML文档进行更新。对于大的压缩文档,如果先解压再更新,会消耗大量时间,因此,高效的更新方法应该避免解压缩文档,在压缩的XML文档上直接进行更新操作。本文针对压缩XML文档中的数值类型（包括整型和浮点型）数据,研究了在保持压缩状态条件下如何进行有效的数值更新,提出了基于XPRESS实现的Naive数值更新方法,以及修改XPRESS编码方法实现的更为高效的Pivot数值更新方法。通过大量的实验证明,Pivot数值更新方法不仅能够提供高效的更新处理,而且保持了XPRESS的高压缩率。     

可查询XML数据压缩技术概述

随着互联网技术的迅速发展,XML已经成为Web上信息表示和数据交换的事实标准。XML数据的冗余性影响了XML数据传输、查询处理等方面的效率,数据压缩是解决冗余的一种途径。介绍了典型的可查询XML压缩技术,阐述了各种压缩技术的优缺点,比较了各压缩技术的压缩率、压缩时间、支持查询的类型等;最后总结了可查询XML压缩技术的不足之处及其发展的趋势。     

XML查询语言

本文综述XML查询语言的研究现状，重点分析W3C的XML查询语言XQuery1.0，同时也介绍了XQuery需要增加的更新功能．本文还介绍了XML查询处理的两种不同思路：基于关系数据库的XML查询处理和基于内存的XML文档的查询处理．     

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

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

基于XML的Web应用研究

分析了基于XML的Web应用所面临的典型问题，给出了解决方案和实例，并提出了XML数据库的设计方法。     

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

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

比较分析XML与HTML

XML（eXtemible Markup Language）是一种可扩展的元置标语言,XML技术的出现,给互联网带来了无限的商机。可以说,XML已经渗透到Intemet的各个角落。文章分别介绍了两种标记语言：超文本标记语言（HTML）和可扩展标记语言（XMC）,并对其作简单的比较分析。     

Comparative Analysis of XML Compression Technologies

XML provides flexibility in publishing and exchanging heterogeneous data on the Web. However, the language is by nature verbose and thus XML documents are usually larger in size than other specifications containing the same data content. It is natural to expect that the data size will continue to grow as XML data proliferates on the Web. The size problem of XML documents hinders the applications of XML, since it substantially increases the costs of storing, processing and exchanging the data. The hindrance is more apparent in bandwidth- and memory-limited settings such as those applications related to mobile communication. In this paper, we survey a range of recently proposed XML specific compression technologies and study their efforts and capabilities to overcome the size problem. First, by categorizing XML compression technologies into queriable and unqueriable compressors, we explain the efforts in the representative technologies that aim at utilizing the exposed structure information from the input XML documents. Second, we discuss the importance of queriable XML compressors and assess whether the compressed XML documents generated from these technologies are able to support direct querying on XML data. Finally, we present a comparative analysis of the state-of-the-art XML conscious compression technologies in terms of compression ratio, compression and decompression times, memory consumption, and query performance.     

XCluster:基于聚类支持查询的XML多文档压缩方法

XML已成为各种网络应用中数据存储和数据交换的标准.XML数据管理面临的最大困难在于结构与数据混合存储导致大量数据冗余,这极大地增加了XML数据存储、交换和处理的代价.对XML文档进行压缩可以在一定程度上解决这个问题.但现有XML压缩方法大都仅压缩单文档中的冗余信息.利用XML文档间的相似性,提出一种支持查询的多XML文档压缩存储方法XCluster.XCluster先利用XML有根有序标签树上改进的pq-gram近似距离对XML文档集进行层次聚类;然后合并每个聚类结果子集中文档的结构得到结构代表并进行字典编码压缩;同时合并不同文档内同一标签下的值内容,并根据其数据类型进行相应编码压缩.实验结果表明,在真实和生成的XML多文档数据集上,XCluster比XGrind和XQilla具有更好的压缩效果和查询效率.     

XML数据压缩技术综述

随着互联网技术的迅速发展,XML已经成为Web上信息表示和数据交换的事实标准。由于XML具有自我描述能力,使得XML文档显得冗长,以至于包含了大量的冗余信息,这样必将影响数据查询处理和交换的效率。因此,XML数据压缩技术对于减少资源的使用显得特别重要。概述了XML压缩研究的现状;分析了典型的XML压缩技术,对其性能进行了比较;总结XML压缩技术的不足及发展趋势。     

基于结构标记树的XML可查询压缩方法

针对支持查询的XML数据压缩方法存在的路径和数据重复等问题,通过去除XML数据中的重复路径,简化XML数据结构,提出结构标记树的概念及其生成算法,设计一种基于结构标记树的可查询XML数据压缩方法SSTQC,对XML数据进行压缩和组织查询。SSTQC一次扫描XML文档,具有较好的的压缩性能和查询效率。     

Divide, Compress and Conquer: Querying XML via Partitioned Path-Based Compressed Data Blocks

We propose a novel partition path-based (PPB) grouping strategy to store compressed XML data in a stream of blocks. In addition, we employ a minimal indexing scheme called block statistic signature (BSS) on the compressed data, which is a simple but effective technique to support evaluation of selection and aggregate XPath queries of the compressed data. We present a formal analysis and empirical study of these techniques. The BSS indexing is first extended into effective cluster statistic signature (CSS) and multiple-cluster statistic signature (MSS) indexing by establishing more layers of indexes. We analyze how the response time is affected by various parameters involved in our compression strategy such as the data stream block size, the number of cluster layers, and the query selectivity. We also gain further insight about the compression and querying performance by studying the optimal block size in a stream, which leads to the minimum processing cost for queries. The cost model analysis provides a solid foundation for predicting the querying performance. Finally, we demonstrate that our PPB grouping and indexing strategies are not only efficient enough to support path-based selection and aggregate queries of the compressed XML data, but they also require relatively low computation time and storage space when compared with other state-of-the-art compression strategies.     

XQBE: A Graphical Environment to Query XML Data

XQuery, the standard query language for XML, is increasingly popular among computer scientists with SQL background, since XQuery and SQL require comparable skills. However, these experts are limited in number, and the availability of easier XQuery “dialects” could be extremely valuable. With this motivation in mind, we designed XQBE, a visual dialect of XQuery inspired by the QBE language (Query by Example). Coherent with the hierarchical nature of XML, XQBE uses one or more hierarchical structures to denote the input documents and one structure to denote the document produced in output. These structures are annotated to express selection predicates; explicit binding edges connecting the nodes of these structures visualize the input/output mappings. This paper presents XQBE through several examples and describes the main features of our implementation of the language, a visual editor coupled with an XQBE-to-XQuery translator. Indeed, the XQBE front-end is a general purpose user-friendly visual query interface, capable of providing access to any data storage system that exposes XQuery APIs. Available schema information can be exploited to guide users in querying data sets they are not familiar with. Also, switching between the visual and textual versions of the same query could be helpful for XQuery learners.