We introduce a compressed representation of sets of sets that exploits how much they differ from each other. Our representation supports access, membership, predecessor and successor queries on the sets within logarithmic time. In addition, we give a new MST-based construction algorithm for the representation that outperforms standard ones.

翻译：本文提出了一种集合的集合的压缩表示方法，该方法利用了集合之间的差异程度。我们的表示支持在集合上进行访问、成员查询、前驱和后继查询，时间复杂度均为对数级别。此外，我们提出了一种新的基于最小生成树（MST）的表示构造算法，其性能优于标准算法。