Inverted indexes deal with millions of sorted integers and could benefit from the same ideas, but posting lists have their own specifics: values are monotonically increasing integers, blocks are much smaller compared to columnar storage and the access pattern is typically different.
The article is a deep dive into how we implemented per-block adaptive compression for our open-source inverted indexing engine IResearch, what problems we ran into and how we solved them.