A simple extension of queriable compression for XML data

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.