Consider an ordered, static tree T where each node has a label from alphabet Σ. Tree T may
be of arbitrary degree and shape. Our goal is designing a compressed storage scheme of T …

XML compression has gained prominence recently because it counters the disadvantage of
the verbose representation XML gives to data. In many applications, such as data exchange …

We consider a compressed form of the word problem for finitely presented monoids, where
the input consists of two compressed representations of words over the generators of a …

The invention concerns the compression, querying and updat ing of tree structured data. For
example, but not limited to, the invention concerns a synopsis (16) of a database system that …

We revisit tree compression with top trees (Bille et al.[2]), and present several improvements
to the compressor and its analysis. By significantly reducing the amount of information stored …

The complexity of various membership problems for tree automata on compressed trees is
analyzed. Two compressed representations are considered: dags, which allow to share …

As XML database sizes grow, the amount of space used for storing the data and auxiliary
data structures becomes a major factor in query and update performance. This paper …

Estimating the selectivity of queries is a crucial problem in database systems. Virtually all
database systems rely on the use of selectivity estimates to choose amongst the many …

Term unification plays an important role in many areas of computer science, especially in
those related to logic. The universal mechanism of grammar-based compression for terms …

This paper is an investigation of the matching problem for term equations s= t where s
contains context variables and first-order variables, and both terms s and t are given using …