高级检索
    包小源, 唐世渭, 杨冬青. Interval\++——一种基于区间树的压缩XML索引结构[J]. 计算机研究与发展, 2006, 43(7): 1285-1290.
    引用本文: 包小源, 唐世渭, 杨冬青. Interval\++——一种基于区间树的压缩XML索引结构[J]. 计算机研究与发展, 2006, 43(7): 1285-1290.
    Bao Xiaoyuan, Tang Shiwei, Yang Dongqing. Interval\++—An Index Structure on Compressed XML Data Based on Interval Tree[J]. Journal of Computer Research and Development, 2006, 43(7): 1285-1290.
    Citation: Bao Xiaoyuan, Tang Shiwei, Yang Dongqing. Interval\++—An Index Structure on Compressed XML Data Based on Interval Tree[J]. Journal of Computer Research and Development, 2006, 43(7): 1285-1290.

    Interval\++——一种基于区间树的压缩XML索引结构

    Interval\++—An Index Structure on Compressed XML Data Based on Interval Tree

    • 摘要: XML在数据交换中的应用越来越广泛,但由于标记引入而使其空间膨胀较大,对传输及存储资源耗费严重.压缩后的XML数据容量明显减少,但怎样基于压缩后的XML数据直接进行查询及处理,仍然是需要深入研究的问题.以反向算术压缩为基本压缩算法,提出针对XML数据库中压缩XML文件的索引结构Interval\++,基于该索引结构,可高效实现对类似//element\-1/element\-2/…/elment\-m的查询处理.

       

      Abstract: Even XML is used as a popular data exchange standard over the Internet and Intranet. Because of adding tags to every different semantic content unit. Its space expansion makes the transmitting and storing of XML data very expensive in terms of resources. After compressed, XML's size is much smaller, but how to evaluate query directly based on the compressed data still requires us to do some work. An XML index structure Interval\++ on compressed data is proposed, which is the result from revert arithmetic compression. Queries as the form of //element\-1/element\-2/…/elment\-m can be evaluated efficiently using Interval\++.

       

    /

    返回文章
    返回