XML硬件加速技术研究

介绍了XML加速器的基本原理,着重对硬件加速的关键环节——XML解析过程进行了探讨,对比DOM和SAX模型,较为详细地阐述了一种新的解析技术VTD-XML,分析它的性能优势和硬件实现前景,并给出了系统结构图。     

基于VTD-XML的流程定义文件解析方法研究

针对传统的DOM和SAX解析技术进行分析,指出它们存在的缺陷:DOM使用方便但内存消耗大,SAX内存消耗低却难以回访。本文利用VTD-XML技术对XPath的支持,提出一种解析流程定义文件的实现方案,实验结果表明该方案提高了解析效率,降低了内存消耗。     

基于索引的高性能XML解析器研究

传统的XML解析方法只是从内存模型以及API的角度规范了解析XML文档所遵循的规则,不仅难以看到XML解析的本质,在性能上也难以满足高并发系统的要求.本论文针对XML解析过程中所出现的各种操作,以集合的语言定义了服务集元操作Metaset,从而赋予了XML解析的逻辑语义.在实现过程中沿用了VTD-XML中的索引结构,实现了高性能的XML解析方法.最后与主流的XML解析器DOM、SAX、STAX作了性能比较.证明了本文观点的正确性.     

基于Avalon总线的XML解析器设计

嵌入式系统和Web Service技术的融合是嵌入式系统发展的一个新方向。由于嵌入式系统本身运算能力和资源的限制,XML解析成为嵌入式系统快速处理SOAP消息进而更好地支持Web Service技术的瓶颈之一。在VTD-XML解析模型的基础上,设计了一个基于Avalon总线的IP核来分担XML解析的一部分任务,减轻嵌入式系统的运算负荷和片内资源消耗,从而提高嵌入式系统的XML解析性能。     

基于多核处理器的VTD-XML节点查询执行性能优化

针对目前主流的多核处理器,研究了基于VTD-XML的节点查询执行性能优化,即基于预读策略从多线程并发执行和提高线程内存访问性能两个方面优化XML节点查询的性能。实验结果表明,提出的多线程XML文档解析框架可以充分利用多核处理器的计算资源,并有效地提高线程的内存访问性能,大大提高了XML节点查询的性能。     

基于代码生成的XML自动解析方法研究

为XML解析提供快速、高效的解析生成方法,适应基于XML进行数据交换时的接口变化,提高接口解析适应能力.设计了基于XSD的分析方法,通过分析结果,识别XML文件的结构,并生成基于模式文件的解析程序,通过动态编译解析程序实现接口的动态适应能力.通过试验分析,此方法可以实现对基于元素的XML文件的解析代码生成,运行效率与基...     

基于多核处理器的VTD-XML节点查询执行性能优化

针对目前主流的多核处理器,研究了基于VTD-XML的节点查询执行性能优化,即基于预读策略从多线程并发执行和提高线程内存访问性能两个方面优化XML节点查询的性能。实验结果表明,提出的多线程XML文档解析框架可以充分利用多核处理器的计算资源,并有效地提高线程的内存访问性能,大大提高了XML节点查询的性能。     

一种基于XML的数据库动态建模方法在工程飞行模拟器中的应用研究

针对目前飞行仿真中静态建立数据库模型的方法所存在的问题进行分析,提出了一种基于XML的动态自动建立数据库模型的方法.利用XML文件作为数据格式转换的中间介质,通过XML技术中的DOM生成和解析XML文件,实现了数据库模型参数在不同数据源之间的传输,然后基于得到的参数进行数据库动态建模.该方法已经在某飞行模拟器数据库开发中得到应用.     

Efficiently Querying Large XML Data Repositories: A Survey

Extensible markup language (XML) is emerging as a de facto standard for information exchange among various applications on the World Wide Web. There has been a growing need for developing high-performance techniques to query large XML data repositories efficiently. One important problem in XML query processing is twig pattern matching, that is, finding in an XML data tree D all matches that satisfy a specified twig (or path) query pattern Q. In this survey, we review, classify, and compare major techniques for twig pattern matching. Specifically, we consider two classes of major XML query processing techniques: the relational approach and the native approach. The relational approach directly utilizes existing relational database systems to store and query XML data, which enables the use of all important techniques that have been developed for relational databases, whereas in the native approach, specialized storage and query processing systems tailored for XML data are developed from scratch to further improve XML query performance. As implied by existing work, XML data querying and management are developing in the direction of integrating the relational approach with the native approach, which could result in higher query processing performance and also significantly reduce system reengineering costs.     

基于路径仓的面向对象XML查询处理技术

XML正在迅速成为Internet上数据表示和交换的标准,存储与查询XML数据变得日益重要,如何快速、准确地查询面向对象的XML数据成为当前研究的热点,索引技术是提高查询效率的有效方法。该文基于路径仓索引模式,提出了一种面向对象的XML数据的查询处理技术。     

XML数据的查询技术

XML规范已成为当前网络应用(包括数字图书馆、Web服务以及电子商务)中事实上的数据表达、交换的标准.针对XML数据的查询在当前XML数据管理研究中占有重要的地位,也是当前XML数据处理研究领域的热点方向,相关的研究文献有很多.根据查询模式描述的不同,将当前XML查询技术归入两大类:XML Query方式和XML IR方式.后者又进而可分以为3个子类:XML IR/keyword方式、XML IR/fragment和XML IR/query方式,并从中挑选出3个研究者关注的问题进行了简述,它们是:Twig查询模式的处理、SLCA(smallest lowest common ancestor)节点的获取以及对所获取的XML片段相似性的度量.以方便普通用户使用为准则探讨了相关XML查询技术的优、缺点,将如下4个问题作为需要进一步关注的研究内容:结构化关键字查询及相应的结构相似性度量方法,如何消除XML Query查询处理模式(包含XML IR/query)和XML IR/keyword查询处理模式间数据冗余的问题,XML Query查询方式的理论探讨及其实现以及针对特定应用的XML数据的有效管理.     

基于DOM的XML数据库的索引技术研究

XML作为一种数据交换的国际标准,已经贯穿于Internet应用的各个领域之中,如何快速准确地存储和查询XML数据的数据库技术是一个重要的研究课题。XML索引技术对XML数据库查询处理起着至关重要的作用,提出了基于DOM的XML数据库的索引技术(路径连接索引、值索引和引用索引),解决了传统的基于树的遍历的XML数据查询方法性能上的不足,并着重对处理含有谓词和引用关系等较复杂的查询路径的不同处理方法进行了对比和分析,还给出了索引空间利用率、查询性能和索引维护代价3个方面的标准测试结果,表明新的索引技术可以有效地提高查询处理效率。     

XML document indexes: a classification

XML's increasing diffusion makes efficient XML query processing and indexing all the more critical. Given the semistructured nature of XML documents, however, general query processing techniques won't work. Researchers have proposed several specialized indexing methods that offer query processors efficient access to XML documents, although none are yet fully implemented in commercial products. In this article the classification of XML indexing techniques identifies current practices and trends, offering insight into how developers can improve query processing and select the best solution for particular contexts.     

Optimizing updates of recursive XML views of relations

XML publishing has been an emerging technique for transforming (portions of) a relational database into an XML document, for example, to facilitate interoperability between heterogeneous applications. Such applications may update the XML document and the source relational database must be updated accordingly. In this paper, we consider such XML documents as (possibly) recursively defined XML views of relations. We propose new optimization techniques to efficiently support XML view updates specified via an XPATH expression with recursion and complex filters. The main novelties of our techniques are: (1) we propose a space-efficient relational encoding of recursive XML views; and (2) we push the bulk of update processing inside a relational database. Specifically, a compressed representation of the XML views is stored as extended shared-inlining relations. A space-efficient and updatable 2-hop index is used to optimize XPATH evaluation on XML views. Updates of the XML views are evaluated on these relations and index. View update translation is handled by a heuristic procedure inside a relational database, as opposed to previous middleware approaches. We present an experimental study to demonstrate the effectiveness of our proposed techniques.     

Query Processing and Optimization Techniques over Streamed Fragmented XML

With the extensive use of XML in applications over the Web, efficient query processing over streaming XML has become a core challenge due to one-pass processing and limited resources. Taking advantage of Hole-Filler model for XML fragments, this paper proposes a hybrid structure (FQ-Index) for both the queries and fragments, and proposes an XML fragment processing algorithm to evaluate forward XPath queries over streamed XML fragments. Two optimization rules, dependence pruning and prefix pruning are also developed. Dependence pruning scheme prunes off the dependent operations caused by fragmentation and transforms the queries for XML tag into queries for XML fragments, while prefix pruning scheme prunes off the “redundant” prefix along the path according to the tag structure. The effectiveness of the techniques developed is illustrated with a detailed set of experiments.