A simple extension of queriable compression for XML data
A simple extension of queriable compression for XML data
复制标题
DOI：
10.1109/amt.2005.1505276
复制
发表时间：
2005-05
期刊：
影响因子：
--
通讯作者：
T. Maita;H. Sakamoto
中科院分区：
文献类型：
--
作者：
T. Maita;H. Sakamoto
近年来，为了有效压缩半结构化数据并实现快速查询，提出了一种逆算术编码方法。我们应用这种方法，并开发了一种新的方法，更复杂的查询过程。通过反向算术编码，我们可以检查任何两个路径之间的依赖性，而无需解码，并利用这一性质，得到一个快速查询过程的树结构。然而，由于查询的类型非常有限，因此难以处理一般查询。因此，我们扩展了该算法，实现了查询表达式中的布尔运算“NOT”和“OR”。
Recently, the method of reverse arithmetic encoding for effective compression and fast query process for semi-structured data was proposed. We apply this method and develop a new method for more complicated query process. By the reverse arithmetic encoding, we can check the dependency between any two paths without decoding and using this property, a fast query process over tree structures is obtained. However, it is difficult to handle general queries since the type of query is very restricted. So, we expand the algorithm to realize the Boolean operations "NOT" and "OR" in the query expressions.