We present a linear preprocessing and output-linear delay enumeration algorithm for MSO-queries over trees that are compressed in the well-established grammar-based framework. Time bounds are measured with respect to the size of the compressed representation of the tree. Our result extends previous work on the enumeration of MSO-queries over uncompressed trees and on the enumeration of document spanners over compressed text documents.

翻译：我们提出了一种线性预处理且输出线性延迟的枚举算法，用于在基于语法的成熟压缩框架下的树上进行MSO查询。时间复杂度以树的压缩表示大小来衡量。我们的结果扩展了先前在未压缩树上进行MSO查询枚举以及在压缩文本文档上进行文档跨度枚举的工作。