ArithBi^+——一种基于反向算术压缩的XML索引结构

ArithBi^+ --An XML Index Structure on Reverse Arithmetic Comparessed XML Data

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

Even XML is used as a popular data exchange standard over Internet and Intranet,its space expansion because of adding tags to every different semantic content unit makes the transmitting and storing of XML data very expensive in terms of resources. After compressed, its size will be much smaller, but how to evaluate query directly based on the compressed data is still necessary for us to do some work. We propose an XmL index structure, ArithBi^＋ ,on compressed data which is result from revert arithmetic compression. Queries as the form of//dement1/element2/…/elmentm can be evaluated efficiently using ArithBi^＋.